On the Levenberg-Marquardt methods for convex constrained nonlinear equations

DOI10.3934/jimo.2013.9.227zbMath1294.90061OpenAlexW2319928558MaRDI QIDQ1950063

Jin Yan Fan

Publication date: 24 May 2013

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2013.9.227

zbMATH Keywords

quadratic convergencelocal error boundconstrained Levenberg-Marquardt methodconvex constrained nonlinear equationsprojected Levenberg-Marquardt method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (9)

An inexact projected LM type algorithm for solving convex constrained nonlinear equations ⋮ Stereo visual odometry based on dynamic and static features division ⋮ A locally convergent inexact projected Levenberg-Marquardt-type algorithm for large-scale constrained nonsmooth equations ⋮ Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares ⋮ Supermemory gradient methods for monotone nonlinear equations with convex constraints ⋮ Calibration of a 3D laser rangefinder and a camera based on optimization solution ⋮ A Levenberg-Marquardt method with approximate projections ⋮ A global Newton method for the nonsmooth vector fields on Riemannian manifolds ⋮ An inverse problem involving a viscous eikonal equation with applications in electrophysiology

This page was built for publication: On the Levenberg-Marquardt methods for convex constrained nonlinear equations