QPCOMP: A quadratic programming based solver for mixed complementarity problems

DOI10.1007/BF02614397zbMath0873.90095MaRDI QIDQ1356059

Michael C. Ferris, Stephen C. Billups

Publication date: 30 October 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

variational inequalitiespseudo-monotonicitymixed nonlinear complementarityproximal perturbations

Mathematics Subject Classification ID

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

Related Items

On the regularization of mixed complementarity problems, Solution of monotone complementarity problems with locally Lipschitzian functions, Application of the proximal point method to nonmonotone equilibrium problems, The proximal point method for nonmonotone variational inequalities, A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs, Numerical comparisons of two effective methods for mixed complementarity problems, Metric regularity: characterizations, nonsmooth variations and successive approximation^∗, The Tikhonov regularization for vector equilibrium problems, An NE/SQP method for the bounded nonlinear complementarity problem, QPCOMP, Complementarity problems in GAMS and the PATH solver

Uses Software

• GAMS
• MINOS
• PATH Solver
• MCPLIB
• MILES

Cites Work

• Unnamed Item
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• An inexact NE/SQP method for solving the nonlinear complementarity problem
• A class of smoothing functions for nonlinear and mixed complementarity problems
• Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
• Global Convergence of Damped Newton's Method for Nonsmooth Equations via the Path Search