The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
An Adaptive Nonlinear Least-Squares Algorithm
Open accessAbstract
Least-SquaresNL2SOL is a modular program for solving nonhnear least-squares problems that incorporates a number of novel features.It maintains a secant approximation S to the second-order part of the leastsquares Hessian and adaptively decides when to use this approximation.S is "sized" before updating, something that is similar to Oren-Luenberger scaling.The step choice algorithm is based on minimizing a local quadratic model of the sum of squares ftmctmn constrained to an elhptmal trust regmn centered at the current approximate minimizer This is accomphshed using ideas chscussed by Mor6, together with a special module for assessing the quahty of the step thus computed.These and other ideas behind NL2SOL are discussed, and its evolution and current implementation are also described briefly.
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
The Levenberg-Marquardt algorithm: Implementation and theory
Moré, J. J. (1978) · Lecture Notes in Mathematics · doi:10.1007/bfb0067700 · Cited by 5,773
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
Quasi-Newton Methods, Motivation and Theory
Dennis, Jr., & Moré, J. J. (1977) · SIAM Review · doi:10.1137/1019005 · Cited by 1,553
Self-citationAlgorithms for the Solution of the Nonlinear Least-Squares Problem
Gill, P. E., & Murray, W. (1978) · SIAM Journal on Numerical Analysis · doi:10.1137/0715063 · Cited by 556
Non-Linear Programming Via Penalty Functions
Zangwill, W. I. (1967) · Management Science · doi:10.1287/mnsc.13.5.344 · Cited by 511
Box, M. J. (1966) · The Computer Journal · doi:10.1093/comjnl/9.1.67 · Cited by 372
Smoothing by spline functions. II
Reinsch, C. H. (1971) · Numerische Mathematik · doi:10.1007/bf02169154 · Cited by 333
Comparison 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
Techniques for nonlinear least squares and robust regression
Dennis, J. E., & Welsch, R. E. (1978) · Communications in Statistics - Simulation and Computation · doi:10.1080/03610917808812083 · Cited by 158
Self-citationDavidon, W. C. (1976) · Journal of Optimization Theory and Applications · doi:10.1007/bf00935703 · Cited by 42
Cited by
A SAS Procedure Based on Mixture Models for Estimating Developmental Trajectories
JONES, B. L., NAGIN, D. S., & ROEDER, K. (2001) · Sociological Methods & Research · doi:10.1177/0049124101029003005 · Cited by 2,370
Iterative Methods for Optimization
Kelley, C. T. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970920 · Cited by 2,052
TIMESAT—a program for analyzing time-series of satellite sensor data
Jönsson, P., & Eklundh, L. (2004) · Computers & Geosciences · doi:10.1016/j.cageo.2004.05.006 · Cited by 1,878
Atkeson, C. G., Moore, A. W., & Schaal, S. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006559212014 · Cited by 1,671
Luo, C. H., & Rudy, Y. (1991) · Circulation Research · doi:10.1161/01.res.68.6.1501 · Cited by 1,468
Metadata
- Authors
- Dennis, J. E., Gay, D. M., & Walsh, R. E.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 1981-09
- Volume
- 7
- Issue
- 3
- Pages
- 348-368
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2046915036
- Cited by
- 930
- References
- 14
- FWCI
- 17.23
- Type
- journal article
- Language
- en
- Open access
- bronze
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.