The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The method of moving asymptotes—a new method for structural optimization
Abstract
A new method for non‐linear programming in general and structural optimization in particular is presented. In each step of the iterative process, a strictly convex approximating subproblem is generated and solved. The generation of these subproblems is controlled by so called ‘moving asymptotes’, which may both stabilize and speed up the convergence of the general process.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Structural optimization: A new dual method using mixed variables
Fleury, C., & Braibant, V. (1986) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.1620230307 · Cited by 612
Research works printed but not linked: 4
- Schmit L. A., 1974, Some approximation concepts for structural synthesis, A I A A Journal, 12, 692
- 10.1007/978-94-009-8603-9_30 · doi:10.1007/978-94-009-8603-9_30
- 10.1002/nme.1620141203 · doi:10.1002/nme.1620141203
- 10.1007/BFb0121230 · doi:10.1007/bfb0121230
Cited by
Topology optimization approaches: A comparative review
Sigmund, O., & Maute, K. (2013) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-013-0978-6 · Cited by 2,890
A 99 line topology optimization code written in Matlab
Sigmund, O. (2001) · Structural and Multidisciplinary Optimization · doi:10.1007/s001580050176 · Cited by 2,688
On projection methods, convergence and robust formulations in topology optimization
Wang, F., Lazarov, B. S., & Sigmund, O. (2011) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-010-0602-y · Cited by 1,859
Morphology-based black and white filters for topology optimization
Sigmund, O. (2007) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-006-0087-x · Cited by 1,727
Optimization methods applied to renewable and sustainable energy: A review
Baños, R., Manzano-Agugliaro, F., Montoya, F. G., Gil, C., Alcayde, A., & Gómez, J. (2011) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2010.12.008 · Cited by 1,646
Metadata
- Authors
- Svanberg, K.
- Venue
- International Journal for Numerical Methods in Engineering
- Publisher
- Wiley
- Published
- 1987-02
- Volume
- 24
- Issue
- 2
- Pages
- 359-373
- ISSN
- 0029-5981 (ISSN-L)
- 1097-0207
- OpenAlex
- W2062523101
- Cited by
- 5,573
- References
- 1
- FWCI
- 69.12
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.