Efficient implementation of a variable projection algorithm for nonlinear least squares problems
Fred T. Krogh · Communications of the ACM · 1974
Nonlinear least squares problems frequently arise for which the variables to be solved for can be separated into a linear and a nonlinear part. A variable projection algorithm has been developed recently which is designed to take advantage of the structure of a problem whose variables separate in this way. This paper gives a slightly more efficient and slightly more general version of this algorithm than has appeared earlier.
Cited by 36 works. doi:10.1145/360860.360914 Open-access PDF
Authors
References
- Solving Least Squares Problems
- Solving Least Squares Problems.
- The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
- The differentiation of pseudo-inverses and non-linear least squares problems whose variables separate.
- Derivative free analogues of the Levenberg-Marquardt and Gauss algorithms for nonlinear least squares approximation