The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
Abstract
If a nonlinear programming problem is analyzed in terms of its ordinary Lagrangian function, there is usually a duality gap, unless the objective and constraint functions are convex. It is shown here that the gap can be removed by passing to an augmented Lagrangian which involves quadratic penalty-like terms. The modified dual problem then consists of maximizing a concave function of the Lagrange multipliers and an additional variable, which is a penalty parameter. In contrast to the classical case, the multipliers corresponding to inequality constraints in the primal are not constrained a priori to be nonnegative in the dual. If the maximum in the dual problem is attained (and conditions implying this are given), optimal solutions to the primal can be represented in terms of global saddle points of the augmented Lagrangian. This suggests possible improvements of existing penalty methods for computing solutions.
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
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Self-citationMultiplier and gradient methods
Hestenes, M. R. (1969) · Journal of Optimization Theory and Applications · doi:10.1007/bf00927673 · Cited by 2,446
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
Studies in Linear and Non-Linear Programming.
Beale, E. M. L., Arrow, K. J., Hurwicz, L., Uzawa, H., Chenery, H. B., Johnson, S. M., Karlin, S., Marschak, T., & Solow, R. M. (1959) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2342801 · Cited by 915
The multiplier method of Hestenes and Powell applied to convex programming
Rockafellar, R. T. (1973) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934777 · Cited by 705
Self-citationNumerical Methods for Non-Linear Optimization
Vajda, S., & Lootsma, F. A. (1973) · Operational Research Quarterly (1970-1977) · doi:10.2307/3008352 · Cited by 589
A dual approach to solving nonlinear programming problems by unconstrained optimization
Rockafellar, R. T. (1973) · Mathematical Programming · doi:10.1007/bf01580138 · Cited by 443
Self-citationMangasrian, O. L. (1972) · Journal of Engineering for Industry · doi:10.1115/1.3428164 · Cited by 134
On the method of multipliers for mathematical programming problems
Miele, A., Moseley, P. E., Levy, A. V., & Coggins, G. M. (1972) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934960 · Cited by 109
Use of the augmented penalty function in mathematical programming problems, part 1
Miele, A., Cragg, E. E., Iyer, R. R., & Levy, A. V. (1971) · Journal of Optimization Theory and Applications · doi:10.1007/bf00928472 · Cited by 69
A Class of Methods for Nonlinear Programming II Computational Experience
Fletcher, R., & LILL, S. A. (1970) · Elsevier eBooks · doi:10.1016/b978-0-12-597050-1.50007-5 · Cited by 64
Use of the augmented penalty function in mathematical programming problems, part 2
Miele, A., Cragg, E. E., & Levy, A. V. (1971) · Journal of Optimization Theory and Applications · doi:10.1007/bf00928473 · Cited by 46
Cited by
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
Self-citationBertsekas, D. P. (1976) · Automatica · doi:10.1016/0005-1098(76)90077-7 · Cited by 347
PETSc/TAO Users Manual (Rev. 3.19)
Argonne National Laboratory (ANL), A., Balay, S., USDOE Office of Science (SC), A. S. C. R. (., Abhyankar, S., Adams, M., Benson, S., Brown, J., Brune, P., Buschelman, K., Constantinescu, E., et al. (2023) · doi:10.2172/1968587 · Cited by 67
Metadata
- Authors
- Rockafellar, R. T.
- Venue
- SIAM Journal on Control
- Published
- 1974-05
- Volume
- 12
- Issue
- 2
- Pages
- 268-285
- ISSN
- 0036-1402 (ISSN-L)
- OpenAlex
- W2037091587
- Cited by
- 587
- References
- 12
- FWCI
- 16.77
- 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.