Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,003,617 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Adobe Photoshop
Algebraic modeling language
Complementarity theory
GAMS
Expand
Broader (1)
Mathematical optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Combining bottom-up and top-down
Christoph Böhringer
,
T. Rutherford
2008
Corpus ID: 963817
Highly Cited
2008
Highly Cited
2008
Generalized Nash equilibrium problems and Newton methods
F. Facchinei
,
A. Fischer
,
V. Piccialli
Mathematical programming
2008
Corpus ID: 14783985
The generalized Nash equilibrium problem, where the feasible sets of the players may depend on the other players’ strategies, is…
Expand
2001
2001
Solving nonlinear complementarity problems with neural networks: a reformulation method approach
L. Liao
,
H. Qi
,
Liqun Qu
2001
Corpus ID: 18821279
Highly Cited
2000
Highly Cited
2000
A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
L. Qi
,
Defeng Sun
,
Guanglu Zhou
Mathematical programming
2000
Corpus ID: 2987446
Abstract.In this paper we take a new look at smoothing Newton methods for solving the nonlinear complementarity problem (NCP) and…
Expand
Highly Cited
1999
Highly Cited
1999
A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen-Mangasarian Smoothing Functions
Bintong Chen
,
N. Xiu
SIAM Journal on Optimization
1999
Corpus ID: 16935907
A noninterior continuation method is proposed for nonlinear complementarity problems. It improves the noninterior continuation…
Expand
Highly Cited
1998
Highly Cited
1998
A New Class of Semismooth Newton-Type Methods for Nonlinear Complementarity Problems
C. Kanzow
,
H. Kleinmichel
Computational optimization and applications
1998
Corpus ID: 6851226
We introduce a new, one-parametric class of NCP-functions. This class subsumes the Fischer function and reduces to the minimum…
Expand
Highly Cited
1997
Highly Cited
1997
Engineering and Economic Applications of Complementarity Problems
M. Ferris
,
J. Pang
SIAM Review
1997
Corpus ID: 11219340
This paper gives an extensive documentation of applications of finite-dimensional nonlinear complementarity problems in…
Expand
Highly Cited
1997
Highly Cited
1997
A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
F. Facchinei
,
João L. C. Soares
SIAM Journal on Optimization
1997
Corpus ID: 15880322
We investigate the properties of a new merit function which allows us to reduce a nonlinear complementarity problem to an…
Expand
Highly Cited
1997
Highly Cited
1997
A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
F. Facchinei
,
C. Kanzow
Mathematical programming
1997
Corpus ID: 12186140
A new algorithm for the solation of large-scale nonlinear complementarity problems is introduced. The algorithm is based on a…
Expand
1986
1986
Uniqueness and differentiability of solutions of parametric nonlinear complementarity problems
J. Kyparisis
Mathematical programming
1986
Corpus ID: 38787787
We derive conditions for the local uniqueness of solutions of nonlinear complementarity problems (NCP). We then prove the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE