The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Algorithms for the Solution of the Nonlinear Least-Squares Problem
Abstract
This paper describes a modification to the Gauss–Newton method for the solution of nonlinear least-squares problems. The new method seeks to avoid the deficiencies in the Gauss–Newton method by improving, when necessary, the Hessian approximation by specifically including or approximating some of the neglected terms. The method seeks to compute the search direction without the need to form explicitly either the Hessian approximation or a factorization of this matrix. The benefits of this are similar to that of avoiding the formation of the normal equations in the Gauss-Newton method. Three algorithms based on this method are described; one which assumes that second derivative information is available and two which only assume first derivatives can be computed.
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
Solving Least Squares Problems
Lawson, C. L., & Hanson, R. J. (1995) · doi:10.1137/1.9781611971217 · Cited by 7,103
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
An Automatic Method for Finding the Greatest or Least Value of a Function
Rosenbrock, H. H. (1960) · The Computer Journal · doi:10.1093/comjnl/3.3.175 · Cited by 2,957
Algorithms for Minimization Without Derivatives
G., D., & Brent, R. P. (1974) · Mathematics of Computation · doi:10.2307/2005713 · Cited by 2,847
Solving Least Squares Problems
Bjork, A., Lawson, C. L., & Hanson, R. J. (1976) · Mathematics of Computation · doi:10.2307/2005340 · Cited by 1,146
Non-Linear Programming Via Penalty Functions
Zangwill, W. I. (1967) · Management Science · doi:10.1287/mnsc.13.5.344 · Cited by 511
Methods for Unconstrained Optimization Problems
O, J. M., Kowalik, J., & Osborne, M. R. (1970) · Mathematics of Computation · doi:10.2307/2004893 · Cited by 478
Box, M. J. (1966) · The Computer Journal · doi:10.1093/comjnl/9.1.67 · Cited by 372
Newton-type methods for unconstrained and linearly constrained optimization
Gill, P. E., & Murray, W. (1974) · Mathematical Programming · doi:10.1007/bf01585529 · Cited by 335
Self-citationComparison of Gradient Methods for the Solution of Nonlinear Parameter Estimation Problems
Bard, Y. (1970) · SIAM Journal on Numerical Analysis · doi:10.1137/0707011 · Cited by 267
Application of Stepwise Regression to Non-Linear Estimation
Jennrich, R. I., & Sampson, P. F. (1968) · Technometrics · doi:10.1080/00401706.1968.10490535 · Cited by 246
Function Minimization Without Evaluating Derivatives--a Review
Fletcher, R. (1965) · The Computer Journal · doi:10.1093/comjnl/8.1.33 · Cited by 215
An Iterative Method for Finding Stationary Values of a Function of Several Variables
Powell, M. J. D. (1962) · The Computer Journal · doi:10.1093/comjnl/5.2.147 · Cited by 193
Davidon, W. C. (1976) · Journal of Optimization Theory and Applications · doi:10.1007/bf00935703 · Cited by 42
Cited by
MLESAC: A New Robust Estimator with Application to Estimating Image Geometry
Torr, P. H. S., & Zisserman, A. (2000) · Computer Vision and Image Understanding · doi:10.1006/cviu.1999.0832 · Cited by 2,396
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
Review of Recent Developments in the Field of Magnesium Corrosion
Atrens, A., Song, G., Liu, M., Shi, Z., Cao, F., & Dargusch, M. S. (2015) · Advanced Engineering Materials · doi:10.1002/adem.201400434 · Cited by 806
The Development and Comparison of Robust Methods for Estimating the Fundamental Matrix
Torr, P. H. S., & Murray, D. W. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007927408552 · Cited by 755
Dealing with uncertainty in model updating for damage assessment: a review
Simoen, E., De Roeck, G., & Lombaert, G. (2015) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2014.11.001 · Cited by 540
Metadata
- Authors
- Gill, P. E., & Murray, W.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 1978-10
- Volume
- 15
- Issue
- 5
- Pages
- 977-992
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W2093919938
- Cited by
- 556
- References
- 14
- FWCI
- 3.11
- 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.