The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
A dual approach to solving nonlinear programming problems by unconstrained optimization
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
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
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
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-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
Rosen, J. B. (1972) · Discrete Mathematics · doi:10.1016/0012-365x(72)90127-6 · Cited by 80
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
Cited by
Variational Mode Decomposition
Dragomiretskiy, K., & Zosso, D. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2288675 · Cited by 9,184
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Yin, W., Osher, S., Goldfarb, D., & Darbon, J. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/070703983 · Cited by 1,414
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-citationWu, C., & Tai, X.-C. (2010) · SIAM Journal on Imaging Sciences · doi:10.1137/090767558 · Cited by 615
(2025) · Portfolio Optimization · doi:10.1017/9781009428095.021 · Cited by 553
THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS
Powell, M. J. D. (1978) · Nonlinear Programming 3 · doi:10.1016/b978-0-12-468660-1.50007-4 · Cited by 541
Algorithms for nonlinear constraints that use lagrangian functions
Powell, M. J. D. (1978) · Mathematical Programming · doi:10.1007/bf01588967 · Cited by 514
Bertsekas, D. P. (1976) · Automatica · doi:10.1016/0005-1098(76)90077-7 · Cited by 347
Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
Eckstein, J. (1993) · Mathematics of Operations Research · doi:10.1287/moor.18.1.202 · Cited by 324
Lewis, R. M., & Torczon, V. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623498339727 · Cited by 315
Metadata
- Authors
- Rockafellar, R. T.
- Venue
- Mathematical Programming
- Published
- 1973-12
- Volume
- 5
- Issue
- 1
- Pages
- 354-373
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2084478514
- Cited by
- 443
- References
- 12
- FWCI
- 8.61
- 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.