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.
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… 
2006
2006
In this paper, we extend a class of merit functions proposed by Kanzow et al. (1997) for linear/nonlinear complementarity… 
2000
2000
Smoothing Newton methods for nonlinear complementarity problems NCP(F) often require F to be at least a P0-function in order to… 
Highly Cited
1999
Highly Cited
1999
We propose a continuation method for a class of nonlinear complementarity problems (NCPs), including the NCP with a P0 and R0… 
1995
1995
The Path solver is an implementation of a stabilized Newton method for the solution of the Mixed Complementarity Problem. The… 
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…