The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
Open accessAbstract
The global and local convergence properties of a class of augmented Lagrangian methods for solving nonlinear programming problems are considered. In such methods, simple bound constraints are treated separately from more general constraints and the stopping rules for the inner minimization algorithm have this in mind. Global convergence is proved, and it is established that a potentially troublesome penalty parameter is bounded away from zero.
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
Iterative Solution of Nonlinear Equations in Several Variables
I., E., Ortega, J. M., & Rheinboldt, W. C. (1971) · Mathematics of Computation · doi:10.2307/2004942 · Cited by 4,408
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
Multiplier and gradient methods
Hestenes, M. R. (1969) · Journal of Optimization Theory and Applications · doi:10.1007/bf00927673 · Cited by 2,446
Introduction to linear and nonlinear programming
Polak, E. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100535 · Cited by 2,100
Introduction to linear and nonlinear programming
Luenberger, D. G. (1973) · Medical Entomology and Zoology · Cited by 1,915
Dembo, R. S., Eisenstat, S. C., & Steihaug, T. (1982) · SIAM Journal on Numerical Analysis · doi:10.1137/0719025 · Cited by 1,539
Nonlinear Programming: Analysis and Methods
Avriel, M. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,339
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
Rockafellar, R. T. (1976) · Mathematics of Operations Research · doi:10.1287/moor.1.2.97 · Cited by 1,175
The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
Steihaug, T. (1983) · SIAM Journal on Numerical Analysis · doi:10.1137/0720042 · Cited by 824
Recent Developments in Algorithms and Software for Trust Region Methods
Moré, J. J. (1983) · Mathematical Programming The State of the Art · doi:10.1007/978-3-642-68874-4_11 · Cited by 359
Cited by
The world’s growing municipal solid waste: trends and impacts
Chen, D. M.-C., Bodirsky, B. L., Krueger, T., Mishra, A., & Popp, A. (2020) · Environmental Research Letters · doi:10.1088/1748-9326/ab8659 · Cited by 524
Sharif, M., Amin, J., Raza, M., Yasmin, M., & Satapathy, S. C. (2020) · Pattern Recognition Letters · doi:10.1016/j.patrec.2019.11.017 · Cited by 206
Rieger, T. R., Allen, R. J., Bystricky, L., Chen, Y., Colopy, G. W., Cui, Y., Gonzalez, A., Liu, Y., White, R. D., Everett, R. A., et al. (2018) · Progress in Biophysics and Molecular Biology · doi:10.1016/j.pbiomolbio.2018.06.002 · Cited by 94
Bibliometric Literature Review of Adaptive Learning Systems
Koutsantonis, D., Koutsantonis, K., Bakas, N. P., Plevris, V., Langousis, A., & Chatzichristofis, S. A. (2022) · Sustainability · doi:10.3390/su141912684 · Cited by 21
Metadata
- Authors
- Conn, A. R., Gould, N. I. M., & Toint, P.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 1991-04
- Volume
- 28
- Issue
- 2
- Pages
- 545-572
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W2042613327
- Cited by
- 873
- References
- 17
- FWCI
- 4.60
- Type
- journal article
- Language
- en
- Open access
- green
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 Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds. https://app.cochat.ai/papers/10.1137/0728030
- The paper
- Conn, A. R., Gould, N. I. M., & Toint, P. (1991). A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds. SIAM Journal on Numerical Analysis. https://doi.org/10.1137/0728030
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.
