A new linesearch algorithm for nonlinear least squares problems

From MaRDI portal





A linesearch algorithm for unconstrained nonlinear least squares problems is presented. The purpose of a linesearch algorithm is to approximately minimize the objective function F(x) along a given straight line. While, in general, such algorithms are mostly constructed by interpolating the objective function, the authors exploit the special structure of F(x) as a sum of squares \({1\over2}\sum^{m}_{k=1}Y_ k(x)^ 2\) and suggest to interpolate the residual vector \(y(x)=(y_ 1(x),...,y_ m(x))\) rather than F(x). Numerical results are reported that point out the advantage with the new method.





Describes a project that uses

Uses Software






This page was built for publication: A new linesearch algorithm for nonlinear least squares problems

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