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.
2018
2018
In this paper, using the sign patterns of the solution of the equivalent modulus equation, the resolution of the nonlinear… 
2009
2009
In this paper, we consider a new formulation with recourse for a class of stochastic nonlinear complementarity problems. We show… 
2008
2008
Abstract: In this paper we propose a novel method for solving a nonlinear op-timization problem (NOP) under multipleequality and… 
1995
1995
We extend the smoothing approach to the mixed complementarity problem, and study the limiting behavior of a path deened by… 
1995
1995
We present a new approach to solving nonlinear complementarity problems based on the normal map and adaptations of the projected… 
Highly Cited
1994
Highly Cited
1994
This paper presents a parameterized Newton method using generalized Jacobians and a Broyden-like method for solving nonsmooth… 
1993
1993
This paper is concerned with two well-known families of iterative methods for solving the linear and nonlinear complementarity… 
1992
1992
In this paper we study basic properties of multivalued solution sets of parametric variational inequalities under the assumption… 
1984
1984
Tarski's fixed point theorem is extended to the case of set-valued mappings, and is applied to a class of complementarity… 
1981
1981
A class of not necessarily linear operators A: V → V* is introduced, where the Banach space V and its dual V* carry dual vector…