Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares

DOI10.1137/080732432zbMath1218.90182OpenAlexW1999233724MaRDI QIDQ3078542

No author found.

Publication date: 28 February 2011

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://purl.org/net/epubs/manifestation/6619/bcgmtRALTR2008026.pdf

zbMATH Keywords

global convergencenonlinear least-squaresfirst-order critical pointsregularized Euclidean residual algorithmthe Gauss-Newton algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (25)

On an adaptive regularization for ill-posed nonlinear systems and its trust-region implementation ⋮ Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods ⋮ Local analysis of a spectral correction for the Gauss-Newton model applied to quadratic residual problems ⋮ Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search ⋮ Structured adaptive spectral-based algorithms for nonlinear least squares problems with robotic arm modelling applications ⋮ Newton-MR: inexact Newton method with minimum residual sub-problem solver ⋮ On the use of the energy norm in trust-region and adaptive cubic regularization subproblems ⋮ Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares ⋮ A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares ⋮ Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares ⋮ A higher-order Levenberg-Marquardt method for nonlinear equations ⋮ On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization ⋮ Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality ⋮ Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models ⋮ Updating the regularization parameter in the adaptive cubic regularization algorithm ⋮ Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization ⋮ New updates of incomplete LU factorizations and applications to large nonlinear systems ⋮ A brief survey of methods for solving nonlinear least-squares problems ⋮ Local convergence analysis of the Levenberg-Marquardt framework for nonzero-residue nonlinear least-squares problems under an error bound condition ⋮ Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models ⋮ On the use of iterative methods in cubic regularization for unconstrained optimization ⋮ New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization ⋮ On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization ⋮ Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity ⋮ Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems

This page was built for publication: Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares