The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
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
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
A Rapidly Convergent Descent Method for Minimization
Fletcher, R., & Powell, M. J. D. (1963) · The Computer Journal · doi:10.1093/comjnl/6.2.163 · Cited by 4,583
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 class of methods for solving nonlinear simultaneous equations
Broyden, C. G. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0198670-6 · Cited by 2,788
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
A globally convergent method for nonlinear programming
Han, S. P. (1977) · Journal of Optimization Theory and Applications · doi:10.1007/bf00932858 · Cited by 1,097
Self-citationVariable Metric Method for Minimization
Davidon, W. C. (1991) · SIAM Journal on Optimization · doi:10.1137/0801001 · Cited by 892
Numerical Methods for Non-Linear Optimization
Vajda, S., & Lootsma, F. A. (1973) · Operational Research Quarterly (1970-1977) · doi:10.2307/3008352 · Cited by 589
On the Local and Superlinear Convergence of Quasi-Newton Methods
BROYDEN, C. G., DENNIS, J. E., & MORÉ, J. J. (1973) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/12.3.223 · Cited by 502
Numerical methods for constrained optimization
Gill, P. E., & Murray, W. A. (1974) · Academic Press eBooks · Cited by 454
A New Algorithm for Unconstrained Optimization
POWELL, M. J. D. (1970) · Nonlinear Programming · doi:10.1016/b978-0-12-597050-1.50006-3 · Cited by 447
Robinson, S. M. (1974) · Mathematical Programming · doi:10.1007/bf01585500 · Cited by 254
A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
Stewart, G. W. (1967) · Journal of the ACM · doi:10.1145/321371.321377 · Cited by 203
Goldfarb, D. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117067 · Cited by 202
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
A survey of methods for solving constrained minimization problems via unconstrained minimization
Lootsma, F. A. (1977) · Dialnet (Universidad de la Rioja) · Cited by 40
Cited by
Sequential quadratic programming
Boggs, P. T., & Tolle, J. W. (1995) · Acta Numerica · doi:10.1017/s0962492900002518 · Cited by 1,858
A Multiple Shooting Algorithm for Direct Solution of Optimal Control Problems *
Bock, H. G., & Plitt, K. J. (1984) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)61205-9 · Cited by 1,306
Direct trajectory optimization using nonlinear programming and collocation
Hargraves, C. R., & Paris, S. W. (1987) · Journal of Guidance, Control, and Dynamics · doi:10.2514/3.20223 · Cited by 1,161
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
Metadata
- Authors
- Han, S.-P.
- Venue
- Mathematical Programming
- Published
- 1976-12
- Volume
- 11
- Issue
- 1
- Pages
- 263-282
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2057875970
- Cited by
- 477
- References
- 18
- FWCI
- 9.37
- 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.
