Skip to search formSkip to main contentSkip to account menu

Mixed complementarity problem

Known as: MCP 
Mixed Complementarity Problem (MCP) is a problem formulation in mathematical programming. Many well-known problem types are special cases of, or may… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
1999
Highly Cited
1999
Abstract.In this paper we consider a general algorithmic framework for solving nonlinear mixed complementarity problems. The main… 
Highly Cited
1997
Highly Cited
1997
This paper gives an extensive documentation of applications of finite-dimensional nonlinear complementarity problems in… 
Highly Cited
1997
Highly Cited
1997
This paper provides a means for comparing various computercodes for solving large scale mixed complementarity problems. Wediscuss… 
Highly Cited
1997
Highly Cited
1997
We investigate the properties of a new merit function which allows us to reduce a nonlinear complementarity problem to an… 
Highly Cited
1996
Highly Cited
1996
A new algorithm for the solation of large-scale nonlinear complementarity problems is introduced. The algorithm is based on a… 
Highly Cited
1996
Highly Cited
1996
Global methods for nonlinear complementarity problems formulate the problem as a system of nonsmooth nonlinear equations, or use… 
Highly Cited
1992
Highly Cited
1992
Whether or not the general asymmetric variational inequality problem can be formulated as a differentiable optimization problem… 
Review
1990
Review
1990
Over the past decade, the field of finite-dimensional variational inequality and complementarity problems has seen a rapid…