A Shamanskii-like self-adaptive Levenberg-Marquardt method for nonlinear equations

DOI10.1016/j.camwa.2018.09.039zbMath1442.65093OpenAlexW2895947699WikidataQ129108611 ScholiaQ129108611MaRDI QIDQ2203737

Chang-Feng Ma, Bao-Hua Huang

Publication date: 2 October 2020

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2018.09.039

zbMATH Keywords

nonlinear equationsLevenberg-Marquardt methodlocal error bound conditionself-adaptive strategy

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items (2)

The data filtering based multiple‐stage Levenberg–Marquardt algorithm for Hammerstein nonlinear systems ⋮ A modified Levenberg-Marquardt method for solving system of nonlinear equations

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Shamanskii-like Levenberg-Marquardt method for nonlinear equations
• An efficient nonmonotone trust-region method for unconstrained optimization
• A higher-order Levenberg-Marquardt method for nonlinear equations
• Modified nonmonotone Armijo line search for descent method
• A nonmonotone trust region method with adaptive radius for unconstrained optimization problems
• Some research on Levenberg-Marquardt method for the nonlinear equations
• A note on the Levenberg-Marquardt parameter
• A truncated Newton method with non-monotone line search for unconstrained optimization
• On the computation of the step-size for the CQ-like algorithms for the split feasibility problem
• A high-order modified Levenberg-Marquardt method for systems of nonlinear equations with fourth-order convergence
• On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
• A superlinearly convergent method for the generalized complementarity problem over a polyhedral cone
• A new descent memory gradient method and its global convergence
• The effect of calmness on the solution set of systems of nonlinear equations
• Block SOR methods for the solution of indefinite least squares problems
• A new \(CQ\) method for solving split feasibility problem
• A modified two steps Levenberg-Marquardt method for nonlinear equations
• A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems
• A smoothing Levenberg-Marquardt method for generalized semi-infinite programming
• A family of conjugate gradient methods for large-scale nonlinear equations
• A new class of exact penalty functions and penalty algorithms
• Convergence properties of a self-adaptive Levenberg-Marquardt algorithm under local error bound condition
• A globally convergent BFGS method for nonlinear monotone equations without any merit functions
• Global Convergence of a New Hybrid Gauss–Newton Structured BFGS Method for Nonlinear Least Squares Problems
• The modified Levenberg-Marquardt method for nonlinear equations with cubic convergence
• Tensor Methods for Nonlinear Equations
• Testing Unconstrained Optimization Software
• A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
• A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
• A Nonmonotone Line Search Technique for Newton’s Method
• An efficient adaptive trust-region method for systems of nonlinear equations
• AN IMPROVED ADAPTIVE TRUST-REGION METHOD FOR UNCONSTRAINED OPTIMIZATION
• Accelerating the modified Levenberg-Marquardt method for nonlinear equations
• Benchmarking optimization software with performance profiles.

This page was built for publication: A Shamanskii-like self-adaptive Levenberg-Marquardt method for nonlinear equations