The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Quasi-Newton Methods, Motivation and Theory
Open accessAbstract
This paper is an attempt to motivate and justify quasi-Newton methods as useful modifications of Newton’s method for general and gradient nonlinear systems of equations. References are given to ample numerical justification; here we give an overview of many of the important theoretical results and each is accompanied by sufficient discussion to make the results and hence the methods plausible.
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
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
The algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
The Algebraic Eigenvalue Problem
I., E., & Wilkinson, J. H. (1966) · Mathematics of Computation · doi:10.2307/2003558 · Cited by 5,140
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 new approach to variable metric algorithms
Fletcher, R. (1970) · The Computer Journal · doi:10.1093/comjnl/13.3.317 · Cited by 4,068
Conditioning of quasi-Newton methods for function minimization
Shanno, D. F. (1970) · Mathematics of Computation · doi:10.1090/s0025-5718-1970-0274029-x · Cited by 3,872
A family of variable-metric methods derived by variational means
Goldfarb, D. (1970) · Mathematics of Computation · doi:10.1090/s0025-5718-1970-0258249-6 · Cited by 3,325
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
Minimization of functions having Lipschitz continuous first partial derivatives
Armijo, L. (1966) · Pacific Journal of Mathematics · doi:10.2140/pjm.1966.16.1 · Cited by 1,983
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
Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
Sherman, J., & Morrison, W. J. (1950) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729893 · Cited by 1,402
The Convergence of a Class of Double-rank Minimization Algorithms: 2. The New Algorithm
BROYDEN, C. G. (1970) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/6.3.222 · Cited by 1,213
Convergence Conditions for Ascent Methods
Wolfe, P. (1969) · SIAM Review · doi:10.1137/1011036 · Cited by 1,106
Methods for modifying matrix factorizations
Gill, P. E., Golub, G. H., Murray, W., & Saunders, M. A. (1974) · Mathematics of Computation · doi:10.1090/s0025-5718-1974-0343558-6 · Cited by 590
Numerical Methods for Unconstrained Optimization
G., D., & Murray, W. (1975) · Mathematics of Computation · doi:10.2307/2005592 · Cited by 571
Convergence Conditions for Ascent Methods. II: Some Corrections
Wolfe, P. (1971) · SIAM Review · doi:10.1137/1013035 · Cited by 569
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
Self-citationNumerical 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
Maximization by Quadratic Hill-Climbing
Goldfeld, S. M., Quandt, R. E., & Trotter, H. F. (1966) · Econometrica · doi:10.2307/1909768 · Cited by 364
Quasi-Newton Methods for Unconstrained Optimization
GILL, P. E., & MURRAY, W. (1972) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/9.1.91 · Cited by 359
Newton-type methods for unconstrained and linearly constrained optimization
Gill, P. E., & Murray, W. (1974) · Mathematical Programming · doi:10.1007/bf01585529 · Cited by 335
Goldstein, A. A. (1965) · SIAM Journal on Control · doi:10.1137/0303013 · Cited by 250
Modification of a quasi-Newton method for nonlinear equations with a sparse Jacobian
Schubert, L. K. (1970) · Mathematics of Computation · doi:10.1090/s0025-5718-1970-0258276-9 · Cited by 205
The Approximate Minimization of Functionals
G., D., & Daniel, J. W. (1972) · Mathematics of Computation · doi:10.2307/2005894 · Cited by 178
The convergence of single-rank quasi-Newton methods
Broyden, C. G. (1970) · Mathematics of Computation · doi:10.1090/s0025-5718-1970-0279993-0 · Cited by 124
Cited by
Updating quasi-Newton matrices with limited storage
Nocedal, J. (1980) · Mathematics of Computation · doi:10.1090/s0025-5718-1980-0572855-7 · Cited by 2,958
Mixture Densities, Maximum Likelihood and the EM Algorithm
Redner, R. A., & Walker, H. F. (1984) · SIAM Review · doi:10.1137/1026034 · Cited by 2,693
Sequential quadratic programming
Boggs, P. T., & Tolle, J. W. (1995) · Acta Numerica · doi:10.1017/s0962492900002518 · Cited by 1,858
“The expository paper Dennis and More (1977) is a good source for an introductory discussion of bounded deterioration and of updating methods satisfying the secant condition in the setting of unconstrained optimization.”
BackgroundA fast algorithm for nonlinearly constrained optimization calculations
Powell, M. J. D. (1978) · Lecture Notes in Mathematics · doi:10.1007/bfb0067703 · Cited by 1,661
The isothermal flash problem. Part I. Stability
Michelsen, M. L. (1982) · Fluid Phase Equilibria · doi:10.1016/0378-3812(82)85001-2 · Cited by 1,264
Metadata
- Authors
- Dennis, Jr., & Moré, J. J.
- Venue
- SIAM Review
- Published
- 1977-01
- Volume
- 19
- Issue
- 1
- Pages
- 46-89
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2062294426
- Cited by
- 1,553
- References
- 28
- FWCI
- 35.68
- 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
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.