Global convergence of a regularized factorized quasi-Newton method for nonlinear least squares problems

DOI10.1590/S1807-03022010000200006zbMath1201.90203OpenAlexW2078588358MaRDI QIDQ5962402

Weijun Zhou, Li Zhang

Publication date: 22 September 2010

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1590/s1807-03022010000200006

zbMATH Keywords

global convergencenonlinear least squaresfactorized quasi-Newton method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Methods of quasi-Newton type (90C53)

Related Items (9)

A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems ⋮ A regularized limited memory BFGS method for nonconvex unconstrained minimization ⋮ New BFGS method for unconstrained optimization problem based on modified Armijo line search ⋮ Distributed Gauss-Newton optimization method for history matching problems with multiple best matches ⋮ Association of Jensen's inequality for \(s\)-convex function with Csiszár divergence ⋮ Optimal two-parameter geometric and arithmetic mean bounds for the Sándor-Yang mean ⋮ A note on generalized convex functions ⋮ Some new fractional integral inequalities for exponentially \(m\)-convex functions via extended generalized Mittag-Leffler function ⋮ Hermite-Hadamard type inequalities for co-ordinated convex and qausi-convex functions and their applications

Uses Software

• minpack

This page was built for publication: Global convergence of a regularized factorized quasi-Newton method for nonlinear least squares problems