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
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
Updating the Inverse of a Matrix
Hager, W. W. (1989) · SIAM Review · doi:10.1137/1031049 · Cited by 1,103
An Adaptive Nonlinear Least-Squares Algorithm
Dennis, J. E., Gay, D. M., & Walsh, R. E. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355958.355965 · Cited by 930
Self-citationModeling Soil Processes: Review, Key Challenges, and New Perspectives
Vereecken, H., Schnepf, A., Hopmans, J. W., Javaux, M., Or, D., Roose, T., Vanderborght, J., Young, M. H., Amelung, W., Aitkenhead, M., et al. (2016) · Vadose Zone Journal · doi:10.2136/vzj2015.09.0131 · Cited by 833
A Survey of Optimization Methods From a Machine Learning Perspective
Sun, S., Cao, Z., Zhu, H., & Zhao, J. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2950779 · Cited by 789
Some numerical experiments with variable-storage quasi-Newton algorithms
Gilbert, J. C., & Lemaréchal, C. (1989) · Mathematical Programming · doi:10.1007/bf01589113 · Cited by 759
A paradigm for data-driven predictive modeling using field inversion and machine learning
Parish, E. J., & Duraisamy, K. (2016) · Journal of Computational Physics · doi:10.1016/j.jcp.2015.11.012 · Cited by 620
Algorithms for nonlinear constraints that use lagrangian functions
Powell, M. J. D. (1978) · Mathematical Programming · doi:10.1007/bf01588967 · Cited by 514
The solution of nonlinear finite element equations
Matthies, H., & Strang, G. (1979) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.1620141104 · Cited by 511
Rank-one modification of the symmetric eigenproblem
Bunch, J. R., Nielsen, C. P., & Sorensen, D. C. (1978) · Numerische Mathematik · doi:10.1007/bf01396012 · Cited by 482
Linear and Nonlinear Programming
Iusem, A. N. (2001) · International Encyclopedia of the Social & Behavioral Sciences · doi:10.1016/b0-08-043076-7/00610-0 · Cited by 460
Machine-Learning-Augmented Predictive Modeling of Turbulent Separated Flows over Airfoils
Singh, A. P., Medida, S., & Duraisamy, K. (2017) · AIAA Journal · doi:10.2514/1.j055595 · Cited by 435
Klein, S., Staring, M., & Pluim, J. P. W. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.909412 · Cited by 431
Truncated-Newton algorithms for large-scale unconstrained optimization
Dembo, R. S., & Steihaug, T. (1983) · Mathematical Programming · doi:10.1007/bf02592055 · Cited by 420
Newton-Type Minimization via the Lanczos Method
Nash, S. G. (1984) · SIAM Journal on Numerical Analysis · doi:10.1137/0721052 · Cited by 338
Theory of algorithms for unconstrained optimization
Nocedal, J. (1992) · Acta Numerica · doi:10.1017/s0962492900002270 · Cited by 333
Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region Approach
Gay, D. M. (1983) · ACM Transactions on Mathematical Software · doi:10.1145/356056.356066 · Cited by 322
Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
Byrd, R. H., Nocedal, J., & Yuan, Y.-X. (1987) · SIAM Journal on Numerical Analysis · doi:10.1137/0724077 · Cited by 319
Two classes of multisecant methods for nonlinear acceleration
Fang, H., & Saad, Y. (2009) · Numerical Linear Algebra with Applications · doi:10.1002/nla.617 · Cited by 309
“Proper” Binormal ROC Curves: Theory and Maximum-Likelihood Estimation
Metz, C. E., & Pan, X. (1999) · Journal of Mathematical Psychology · doi:10.1006/jmps.1998.1218 · Cited by 273
Truncated Newton methods and the modeling of complex immersed elastic structures
Fauci, L. J., & Fogelson, A. L. (1993) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160460602 · Cited by 94
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.