Convergence analysis of nonmonotone Levenberg-Marquardt algorithms for complementarity problem
From MaRDI portal
Publication:972943
DOI10.1016/j.amc.2010.03.021zbMath1202.65073OpenAlexW1990191033MaRDI QIDQ972943
Publication date: 21 May 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.03.021
convergencenonsmooth equationsnonlinear complementarity problemnonmonotone Levenberg-Marquardt algorithms
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (4)
A new active-set strategy for NCP with degenerate solutions ⋮ The data filtering based multiple‐stage Levenberg–Marquardt algorithm for Hammerstein nonlinear systems ⋮ A nonmonotone Levenberg-Marquardt method for nonlinear complementarity problems under local error bound ⋮ A Levenberg-Marquardt method for nonlinear complementarity problems based on nonmonotone trust region and line search techniques
Uses Software
Cites Work
- A truncated nonmonotone Gauss-Newton method for large-scale nonlinear least-squares problems
- Some research on Levenberg-Marquardt method for the nonlinear equations
- On almost smooth functions and piecewise smooth functions
- A globally convergent Levenberg-Marquardt method for solving nonlinear complementarity problem
- The convergence of a smoothing damped Gauss-Newton method for nonlinear complementarity problem
- On NCP-functions
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Nonmonotone Levenberg-Marquardt algorithms and their convergence analysis
- Analytic solutions and triality theory for nonconvex and nonsmooth variational problems with applications
- Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- Newton methods for solving two classes of nonsmooth equations.
- On the resolution of monotone complementarity problems
- Nonlinear complementarity as unconstrained optimization
- The quadratic convergence of a smoothing Levenberg-Marquardt method for nonlinear complementarity problem
- Growth behavior of a class of merit functions for the nonlinear complementarity problem
- Unconstrained minimization approaches to nonlinear complementarity problems
- Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems.
This page was built for publication: Convergence analysis of nonmonotone Levenberg-Marquardt algorithms for complementarity problem
