Improved convergence results for a modified Levenberg–Marquardt method for nonlinear equations and applications in MPCC
From MaRDI portal
Publication:2829562
DOI10.1080/10556788.2016.1171863zbMath1386.90154OpenAlexW2336212496MaRDI QIDQ2829562
Publication date: 8 November 2016
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2016.1171863
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems ⋮ Unnamed Item ⋮ A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations ⋮ On convergence properties of the modified trust region method under Hölderian error bound condition ⋮ Improved Convergence Properties of the Relaxation Schemes of Kadrani et al. and Kanzow and Schwartz for MPEC ⋮ Convergence rate of the Levenberg-Marquardt method under Hölderian local error bound ⋮ Convergence properties of inexact Levenberg-Marquardt method under Hölderian local error bound ⋮ Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems ⋮ Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity ⋮ Levenberg-Marquardt method for absolute value equation associated with second-order cone ⋮ Convergence rate of the modified Levenberg-Marquardt method under Hölderian local error bound ⋮ Improved convergence results of an efficient Levenberg-Marquardt method for nonlinear equations
Cites Work
- Solving mathematical programs with equilibrium constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Optimality conditions for bilevel programming problems
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- A method for the solution of certain non-linear problems in least squares