The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS
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
A fast algorithm for nonlinearly constrained optimization calculations
Powell, M. J. D. (1978) · Lecture Notes in Mathematics · doi:10.1007/bfb0067703 · Cited by 1,661
Self-citationA globally convergent method for nonlinear programming
Han, S. P. (1977) · Journal of Optimization Theory and Applications · doi:10.1007/bf00932858 · Cited by 1,097
Numerical Methods for Non-Linear Optimization
Vajda, S., & Lootsma, F. A. (1973) · Operational Research Quarterly (1970-1977) · doi:10.2307/3008352 · Cited by 589
Algorithms for nonlinear constraints that use lagrangian functions
Powell, M. J. D. (1978) · Mathematical Programming · doi:10.1007/bf01588967 · Cited by 514
Self-citationSuperlinearly convergent variable metric algorithms for general nonlinear programming problems
Han, S.-P. (1976) · Mathematical Programming · doi:10.1007/bf01580395 · Cited by 477
A dual approach to solving nonlinear programming problems by unconstrained optimization
Rockafellar, R. T. (1973) · Mathematical Programming · doi:10.1007/bf01580138 · Cited by 443
A quadratically-convergent algorithm for general nonlinear programming problems
Robinson, S. M. (1972) · Mathematical Programming · doi:10.1007/bf01584986 · Cited by 191
Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
García‐Palomares, U. M., & Mangasarian, O. L. (1976) · Mathematical Programming · doi:10.1007/bf01580366 · Cited by 125
Cited by
Sequential quadratic programming
Boggs, P. T., & Tolle, J. W. (1995) · Acta Numerica · doi:10.1017/s0962492900002518 · Cited by 1,858
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Gill, P. E., Murray, W., & Saunders, M. A. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499350013 · Cited by 1,587
Target Cascading in Optimal System Design
Kim, H. M., Michelena, N. F., Papalambros, P. Y., & Jiang, T. (2003) · Journal of Mechanical Design · doi:10.1115/1.1582501 · Cited by 616
Entropy search for information-efficient global optimization
Hennig, P., & Schuler, C. J. (2012) · Journal of Machine Learning Research · doi:10.5555/2188385.2343701 · Cited by 443
Exact penalty functions in nonlinear programming
Evans, J. P., Gould, F. J., & Tolle, J. W. (1973) · Mathematical Programming · doi:10.1007/bf01584647 · Cited by 304
Metadata
- Authors
- Powell, M. J. D.
- Venue
- Nonlinear Programming 3
- Publisher
- Elsevier
- Published
- 1978
- Volume
- 3
- Pages
- 27-63
- OpenAlex
- W1573176827
- Cited by
- 541
- References
- 9
- FWCI
- 9.46
- Type
- book chapter
- 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: THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS. https://app.cochat.ai/papers/10.1016/b978-0-12-468660-1.50007-4
- The paper
- Powell, M. J. D. (1978). THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS. Nonlinear Programming 3. https://doi.org/10.1016/b978-0-12-468660-1.50007-4
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.