Merit functions for nonsmooth complementarity problems and related descent algorithms
From MaRDI portal
Publication:622484
DOI10.1007/s11766-010-2190-4zbMath1224.90163OpenAlexW1987361895MaRDI QIDQ622484
Publication date: 5 February 2011
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-010-2190-4
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Improved Inexact Alternating Direction Methods for a Class of Nonlinear Complementarity Problems ⋮ An inexact alternating direction method of multipliers for a kind of nonlinear complementarity problems
Cites Work
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- On NCP-functions
- Nonlinear complementarity as unconstrained and constrained minimization
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- On the resolution of monotone complementarity problems
- On stationary points of the implicit Lagrangian for nonlinear complementarity problems
- Nonlinear complementarity as unconstrained optimization
- A nonsmooth version of Newton's method
- Growth behavior of a class of merit functions for the nonlinear complementarity problem
- Unconstrained minimization approaches to nonlinear complementarity problems
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Engineering and Economic Applications of Complementarity Problems
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems.
