The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Algorithms for Separable Nonlinear Least Squares Problems
Abstract
Iterative algorithms of Gauss–Newton type for the solution of nonlinear least squares problems are considered. They separate the variables into two sets in such a way that in each iteration, optimization with respect to the first set is performed first, and corrections to those of the second after that. The linear-nonlinear case, where the first set consists of variables that occur linearly, is given special attention, and a new algorithm is derived which is simpler to apply than the variable projection algorithm as described by Golub and Pereyra, and can be performed with no more arithmetical operations than the unseparated Gauss–Newton algorithm. A detailed analysis of the asymptotical convergence properties of both separated and unseparated algorithms is performed. It is found that they have comparable rates of convergence, and all converge almost quadratically for almost compatible problems. Simpler separation schemes, on the other hand, converge only linearly. An efficient and simple computer implementation is described. It uses $QR$ decompositions of appropriate derivative matrices. A series of numerical tests are reported, both on artificial and realistic data. It is found that the theoretical results on asymptotic behavior give a good prediction of the number of iterations needed in a test run. Typical applications are least squares approximation by exponential or rational functions, and overdetermined nonlinear systems of equations; examples are given of both.
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
Nonmetric Multidimensional Scaling: A Numerical Method
Kruskal, J. B. (1964) · Psychometrika · doi:10.1007/bf02289694 · Cited by 4,846
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
The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
Golub, G. H., & Pereyra, V. (1973) · SIAM Journal on Numerical Analysis · doi:10.1137/0710036 · Cited by 1,430
Handbook for Automatic Computation
Wilkinson, J. H., & Reinsch, C. (1971) · Springer eBooks · doi:10.1007/978-3-642-86940-2 · Cited by 545
A variable projection method for solving separable nonlinear least squares problems
Kaufman, L. (1975) · BIT · doi:10.1007/bf01932995 · Cited by 238
A mimmax theory for overdamped systems
Rogers, E. H. (1964) · Archive for Rational Mechanics and Analysis · doi:10.1007/bf00281333 · Cited by 73
Cited by
Separable nonlinear least squares: the variable projection method and its applications
Golub, G., & Pereyra, V. (2003) · Inverse Problems · doi:10.1088/0266-5611/19/2/201 · Cited by 760
Detection and estimation in sensor arrays using weighted subspace fitting
Viberg, M., Ottersten, B., & Kailath, T. (1991) · IEEE Transactions on Signal Processing · doi:10.1109/78.97999 · Cited by 512
Björck, Å. (1990) · Handbook of Numerical Analysis · doi:10.1016/s1570-8659(05)80036-5 · Cited by 313
Lower Rank Approximation of Matrices by Least Squares With Any Choice of Weights
Gabriel, K. R., & Zamir, S. (1979) · Technometrics · doi:10.1080/00401706.1979.10489819 · Cited by 295
A spline least squares method for numerical parameter estimation in differential equations
Varah, J. M. (1982) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0903003 · Cited by 274
Exploiting the Separable Structure of SLAM
Khosoussi, K., Huang, S., & Dissanayake, G. (2015) · Robotics: Science and Systems XI · doi:10.15607/rss.2015.xi.023 · Cited by 14
“A theoretical analysis on the convergence properties of variable projection methods is due to Ruhe and Wedin [24].”
BackgroundMethodInfluential
Metadata
- Authors
- Ruhe, A., & Wedin, P. Å.
- Venue
- SIAM Review
- Published
- 1980-07
- Volume
- 22
- Issue
- 3
- Pages
- 318-337
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2040763577
- Cited by
- 284
- References
- 7
- FWCI
- 2.73
- 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.