A generalized proximal point algorithm for the nonlinear complementarity problem
From MaRDI portal
Publication:4497874
DOI10.1051/ro:1999117zbMath0961.90117OpenAlexW2105990362MaRDI QIDQ4497874
Alfredo Noel Iusem, Regina Sandra Burachik
Publication date: 24 August 2000
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_1999__33_4_447_0/
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (3)
A proximal method with logarithmic barrier for nonlinear complementarity problems ⋮ The Generalized Bregman Distance ⋮ Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness
This page was built for publication: A generalized proximal point algorithm for the nonlinear complementarity problem