A generalized proximal point algorithm for the nonlinear complementarity problem

DOI10.1051/RO:1999117zbMATH Open0961.90117OpenAlexW2105990362MaRDI QIDQ4497874FDOQ4497874

Authors: R. S. Burachik, Alfredo Iusem 

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/

Recommendations

• Existence and proximal point algorithms for nonlinear monotone complementarity problems^*
• Proximal point algorithm for nonlinear complementarity problem based on the generalized Fischer-Burmeister merit function
• An interior proximal point algorithm for nonlinear complementarity problems
• The proximal point algorithm for the \(P_0\) complementarity problem

zbMATH Keywords

nonlinear complementarity problemmonotone operatorsproximal point methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cited In (6)

• Proximal point algorithm for nonlinear complementarity problem based on the generalized Fischer-Burmeister merit function
• Title not available (Why is that?)
• Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness
• A proximal method with logarithmic barrier for nonlinear complementarity problems
• The proximal point algorithm for the \(P_0\) complementarity problem
• The Generalized Bregman Distance

This page was built for publication: A generalized proximal point algorithm for the nonlinear complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4497874)