Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 221,556,393 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.
2009
2009
Combined Monte Carlo sampling and penalty method for Stochastic nonlinear complementarity problems
G. Lin
Mathematics of Computation
2009
Corpus ID: 16347983
In this paper, we consider a new formulation with recourse for a class of stochastic nonlinear complementarity problems. We show…
Expand
2008
2008
A Fictitious Time Integration Method (FTIM) for Solving Mixed Complementarity Problems with Applications to Non-Linear Optimization
Chein-Shan Liu
,
S. Atluri
2008
Corpus ID: 115534724
Abstract: In this paper we propose a novel method for solving a nonlinear op-timization problem (NOP) under multipleequality and…
Expand
2006
2006
Some Properties of a Class of Merit Functions for Symmetric Cone complementarity Problems
Yong-Jin Liu
,
Liwei Zhang
,
Yin-He Wang
Asia Pac. J. Oper. Res.
2006
Corpus ID: 43647329
In this paper, we extend a class of merit functions proposed by Kanzow et al. (1997) for linear/nonlinear complementarity…
Expand
2000
2000
A Smoothing Newton Method for General Nonlinear Complementarity Problems
H. Qi
,
L. Liao
Computational optimization and applications
2000
Corpus ID: 980298
Smoothing Newton methods for nonlinear complementarity problems NCP(F) often require F to be at least a P0-function in order to…
Expand
Highly Cited
1999
Highly Cited
1999
A Global and Local Superlinear Continuation-Smoothing Method for P0 and R0 NCP or Monotone NCP
Bintong Chen
,
Xiaojun Chen
SIAM Journal on Optimization
1999
Corpus ID: 26729694
We propose a continuation method for a class of nonlinear complementarity problems (NCPs), including the NCP with a P0 and R0…
Expand
1995
1995
The Path Solver : A Non-Monotone StabilizationScheme for Mixed Complementarity
P. Dirkse
,
M. Ferris
1995
Corpus ID: 14670479
The Path solver is an implementation of a stabilized Newton method for the solution of the Mixed Complementarity Problem. The…
Expand
1993
1993
Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
J. Pang
Mathematical programming
1993
Corpus ID: 36460937
This paper is concerned with two well-known families of iterative methods for solving the linear and nonlinear complementarity…
Expand
1992
1992
Parametric Variational Inequalities with Multivalued Solution Sets
J. Kyparisis
Mathematics of Operations Research
1992
Corpus ID: 9075946
In this paper we study basic properties of multivalued solution sets of parametric variational inequalities under the assumption…
Expand
1984
1984
An extension of Tarski's fixed point theorem and its application to isotone complementarity problems
T. Fujimoto
Mathematical programming
1984
Corpus ID: 20899223
Tarski's fixed point theorem is extended to the case of set-valued mappings, and is applied to a class of complementarity…
Expand
1981
1981
Equivalence of Nonlinear Complementarity Problems and Least Element Problems in Banach Lattices
R. Riddell
Mathematics of Operations Research
1981
Corpus ID: 42381627
A class of not necessarily linear operators A: V → V* is introduced, where the Banach space V and its dual V* carry dual vector…
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