Computational experience with algorithms for separable nonlinear least squares problems

DOI10.1007/BF02575921MaRDI QIDQ1255756zbMATH OpenFDO

Authors K. Appert

Publication date 1978

Published in Calcolo (Search for Journal in Brave)

zbMATH Keywords

Iterative ProcedureFitting FunctionGauss-Newton and Gauss-Newton-Marquardt SchemesNonlinear Least Squares ProblemsVarious Test Problems

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cites work

• A variable projection method for solving separable nonlinear least squares problems
• Algorithms for Separable Nonlinear Least Squares Problems
• An Algorithm for Least Squares Estimation of Nonlinear Parameters When Some of the Parameters Are Linear
• Derivative free analogues of the Levenberg-Marquardt and Gauss algorithms for nonlinear least squares approximation
• Efficient implementation of a variable projection algorithm for nonlinear least squares problems
• Modified Damped Least Squares: An Algorithm for Non-linear Estimation
• Some Special Nonlinear Least Squares Problems
• The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate

This page was built for publication: Computational experience with algorithms for separable nonlinear least squares problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1255756)