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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2017-07-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/10/3/78 |