An interior point method for the nonlinear complementarity problem

DOI10.1016/S0168-9274(97)00038-XzbMath0882.65057MaRDI QIDQ1369440

Alfredo Noel Iusem

Publication date: 19 February 1998

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

interior point methodnonlinear complementarity problemparamonotone

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A relaxed version of Bregman's method for convex programming
• An iterative row-action method for interval convex programming
• An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
• Proximal minimization algorithm with \(D\)-functions
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming

This page was built for publication: An interior point method for the nonlinear complementarity problem