The prediction-correction approach to nonlinear complementarity problems
From MaRDI portal
Publication:853010
DOI10.1016/j.ejor.2005.11.006zbMath1102.90064OpenAlexW1977349335MaRDI QIDQ853010
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.006
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (10)
The interior proximal extragradient method for solving equilibrium problems ⋮ Some proximal algorithms for linearly constrained general variational inequalities ⋮ A modulus-based nonmonotone line search method for nonlinear complementarity problems ⋮ An LQP-based descent method for structured monotone variational inequalities ⋮ Unnamed Item ⋮ A hybrid LQP-based method for structured variational inequalities ⋮ A new criterion for the inexact logarithmic-quadratic proximal method and its derived hybrid methods ⋮ Numerical solutions of a variable-order fractional financial system ⋮ An improved LQP-based method for solving nonlinear complementarity problems ⋮ Proximal point algorithms for general variational inequalities
Cites Work
- Unnamed Item
- Unnamed Item
- A new approximate proximal point algorithm for maximal monotone operator
- An approximate proximal-extragradient type method for monotone variational inequalities
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A note on a globally convergent Newton method for solving monotone variational inequalities
- Approximate iterations in Bregman-function-based proximal algorithms
- A logarithmic-quadratic proximal method for variational inequalities
- A proximal-based deomposition method for compositions method for convex minimization problems
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- A globally convergent Newton method for solving strongly monotone variational inequalities
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Convergence of Proximal-Like Algorithms
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- Global Methods for Nonlinear Complementarity Problems
- On the basic theorem of complementarity
- A new accuracy criterion for approximate proximal point algorithms
This page was built for publication: The prediction-correction approach to nonlinear complementarity problems
