Global Convergence of a New Hybrid Gauss–Newton Structured BFGS Method for Nonlinear Least Squares Problems

DOI10.1137/090748470zbMath1211.90131OpenAlexW2067251243MaRDI QIDQ3083293

Xiaojun Chen, Weijun Zhou

Publication date: 21 March 2011

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090748470

zbMATH Keywords

global convergencequadratic convergenceBFGS methodGauss-Newton methodnonlinear least squaresstructured quasi-Newton method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)

Related Items

A smoothing trust region filter algorithm for nonsmooth least squares problems ⋮ A hybrid global optimization algorithm for nonlinear least squares regression ⋮ A derivative-free conjugate residual method using secant condition for general large-scale nonlinear equations ⋮ Sketched Newton--Raphson ⋮ A Shamanskii-like self-adaptive Levenberg-Marquardt method for nonlinear equations ⋮ New BFGS method for unconstrained optimization problem based on modified Armijo line search ⋮ Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization ⋮ A brief survey of methods for solving nonlinear least-squares problems ⋮ Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints ⋮ A globally convergent BFGS method for symmetric nonlinear equations ⋮ A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems

Uses Software

• Regularization tools