The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
Abstract
This paper deals with a certain class of optimization methods, based on conservative convex separable approximations (CCSA), for solving inequality-constrained nonlinear programming problems. Each generated iteration point is a feasible solution with lower objective value than the previous one, and it is proved that the sequence of iteration points converges toward the set of Karush--Kuhn--Tucker points. A major advantage of CCSA methods is that they can be applied to problems with a very large number of variables (say 10 4 --10 5 ) even if the Hessian matrices of the objective and constraint functions are dense.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Optimization by Vector Space Methods
(1970) · Students Quarterly Journal · doi:10.1049/sqj.1970.0088 · Cited by 6,004
Practical methods of optimization
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90129-2 · Cited by 5,818
The method of moving asymptotes—a new method for structural optimization
Svanberg, K. (1987) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.1620240207 · Cited by 5,573
Self-citationNonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1968) · Defense Technical Information Center (DTIC) · Cited by 2,262
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
Powell, M. J. D. (1969) · The Computer Journal · doi:10.1093/comjnl/12.3.207-a · Cited by 1,757
Practical methods of optimization; (2nd ed.)
Fletcher, R. (1987) · Wiley-Interscience eBooks · Cited by 964
Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
Forsgren, A., & Gill, P. E. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496305560 · Cited by 174
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 review about the engineering design of optimal heat transfer systems using topology optimization
Dbouk, T. (2017) · Applied Thermal Engineering · doi:10.1016/j.applthermaleng.2016.10.134 · Cited by 469
Length scale and manufacturability in density-based topology optimization
Lazarov, B. S., Wang, F., & Sigmund, O. (2016) · Archive of Applied Mechanics · doi:10.1007/s00419-015-1106-4 · Cited by 319
Inverse design enables large-scale high-performance meta-optics reshaping virtual reality
Li, Z., Pestourie, R., Park, J.-S., Huang, Y.-W., Johnson, S. G., & Capasso, F. (2022) · Nature Communications · doi:10.1038/s41467-022-29973-3 · Cited by 280
Topology-Optimized Multilayered Metaoptics
Lin, Z., Groever, B., Capasso, F., Rodriguez, A. W., & Lončar, M. (2018) · Physical Review Applied · doi:10.1103/physrevapplied.9.044030 · Cited by 203
Metadata
- Authors
- Svanberg, K.
- Venue
- SIAM Journal on Optimization
- Published
- 2002-01
- Volume
- 12
- Issue
- 2
- Pages
- 555-573
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2153245297
- Cited by
- 1,371
- References
- 8
- FWCI
- 5.69
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations. https://app.cochat.ai/papers/10.1137/s1052623499362822
- The paper
- Svanberg, K. (2002). A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations. SIAM Journal on Optimization. https://doi.org/10.1137/s1052623499362822
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.
