2012
DOI: 10.1007/s10589-012-9492-9
|View full text |Cite
|
Sign up to set email alerts
|

Variable projection for nonlinear least squares problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
116
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 146 publications
(117 citation statements)
references
References 12 publications
1
116
0
Order By: Relevance
“…The special structure of our cost function allows us to use the variable projection optimization algorithm by O’Leary and Rust (2013) which separates the optimization problem into linear and nonlinear parts to obtain more accurate parameter estimation. Rearranging of S υ, i in the form of Sυ,i=j=12cυ,jΦjfalse(θj,kjfalse), we obtain the least squares problem of the form i=1Ntrue(Mυ,ij=12cυ,jnormalΦfalse(θj,kjfalse)true)2 where c υ,1 = So υ × f υ , c υ,2 = So υ × (1 − f υ ) are the linear parameters and θ j , k j are the nonlinear parameters.…”
Section: Theorymentioning
confidence: 99%
“…The special structure of our cost function allows us to use the variable projection optimization algorithm by O’Leary and Rust (2013) which separates the optimization problem into linear and nonlinear parts to obtain more accurate parameter estimation. Rearranging of S υ, i in the form of Sυ,i=j=12cυ,jΦjfalse(θj,kjfalse), we obtain the least squares problem of the form i=1Ntrue(Mυ,ij=12cυ,jnormalΦfalse(θj,kjfalse)true)2 where c υ,1 = So υ × f υ , c υ,2 = So υ × (1 − f υ ) are the linear parameters and θ j , k j are the nonlinear parameters.…”
Section: Theorymentioning
confidence: 99%
“…Hence, the optimization algorithm may converge to a local minimum. However, the literature [32] suggests that the VP algorithm is more likely to converge to the global minimum than other algorithms such as block-coordinate descent algorithms. Our computer-simulation studies revealed that the VP algorithm consistently converged to accurate solutions, suggesting that utilizing proper regularization methods and good initial guesses will improve the ability of the algorithm to avoid local minima.…”
Section: Conclusion and Discussionmentioning
confidence: 99%
“…Note that Line-7 can be computed much more efficiently than the problem arg min θ ≥0 φ ( θ , h k ). In addition, VP algorithms have been reported to possess faster convergence rates and may be less likely to be become trapped by local minima as compared to block-coordinate descent algorithms [32]. …”
Section: Pact Image Reconstruction Without Accurate Knowledge Ofmentioning
confidence: 99%
“…The minimization problem is implemented in Matlab making use of the built-in trust region minimization algorithm and the VARPRO implementation given by [18]. The Bloch equation simulator is implemented in C [19] and was adapted to include slice profile response, off-resonance effects and B1+ inhomogeneities.…”
Section: Methodsmentioning
confidence: 99%