Feasible descent algorithms for mixed complementarity problems
From MaRDI portal
Publication:1968793
DOI10.1007/s101070050101zbMath0946.90094MaRDI QIDQ1968793
Christian Kanzow, Michael C. Ferris, Todd S. Munson
Publication date: 21 March 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050101
global convergence; superlinear convergence; mixed complementarity problems; feasible descent methods
49M37: Numerical methods based on nonlinear programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
A new proximal-based globalization strategy for the Josephy‐Newton method for variational inequalities, On a semismooth least squares formulation of complementarity problems with gap reduction, Nonholonomic elastoplastic analysis involving unilateral frictionless contact as a mixed complementarity problem, Complementarity problems in GAMS and the PATH solver, Some recent advances in projection-type methods for variational inequalities
Uses Software