An Efficient Algorithm for the Separable Nonlinear Least Squares Problem

An Efficient Algorithm for the Separable Nonlinear Least Squares Problem

The nonlinear least squares problem m i n y , z ∥ A ( y ) z + b ( y ) ∥ , where A ( y ) is a full-rank ( N + ℓ ) × N matrix, y ∈ R n , z ∈ R N and b ( y ) ∈ R N + ℓ with ℓ ≥ n , can be solved by first solving a reduced problem...

Full description

Bibliographic Details
Main Authors: Yunqiu Shen, Tjalling J. Ypma
Format: Article
Language:English
Published: MDPI AG 2017-07-01
Series:Algorithms
Subjects:
separable equations
nonlinear least squares
full-rank matrices
QR factorization
over-determined systems
Gauss–Newton method
least squares solutions
LU factorization
quadratic convergence
Online Access:https://www.mdpi.com/1999-4893/10/3/78

Internet

https://www.mdpi.com/1999-4893/10/3/78

Similar Items