The Levenberg-Marquardt-type methods for a kind of vertical complementarity problem
From MaRDI portal
Publication:410763
DOI10.1155/2011/161853zbMath1242.90259OpenAlexW2135311408WikidataQ58690271 ScholiaQ58690271MaRDI QIDQ410763
Publication date: 4 April 2012
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2011/161853
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On a global complexity bound of the Levenberg-marquardt method
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- On almost smooth functions and piecewise smooth functions
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- Regularized Newton method for unconstrained convex optimization
- A modified Levenberg-Marquardt method for nonsmooth equations with finitely many maximum functions
- Nonlinear complementarity as unconstrained and constrained minimization
- 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
- Newton methods for solving two classes of nonsmooth equations.
- A nonsmooth version of Newton's method
- The quadratic convergence of a smoothing Levenberg-Marquardt method for nonlinear complementarity problem
- An approximate Newton method for non-smooth equations with finite max functions
- Convergence properties of a self-adaptive Levenberg-Marquardt algorithm under local error bound condition
- Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
- Nonsmooth Equations: Motivation and Algorithms
- The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities
- Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems.