Nonlinear complementarity problem
Mathematics problem
In applied mathematics, a nonlinear complementarity problem (NCP) with respect to a mapping ƒ : Rn → Rn, denoted by NCPƒ, is to find a vector x ∈ Rn such that
where ƒ(x) is a smooth mapping. The case of a discontinuous mapping was discussed by Habetler and Kostreva (1978).
References
- Ahuja, Kapil; Watson, Layne T.; Billups, Stephen C. (December 2008). "Probability-one homotopy maps for mixed complementarity problems". Computational Optimization and Applications. 41 (3): 363–375. doi:10.1007/s10589-007-9107-z. hdl:10919/31539.
- Cottle, Richard W.; Pang, Jong-Shi; Stone, Richard E. (1992). The linear complementarity problem. Computer Science and Scientific Computing. Boston, MA: Academic Press, Inc. pp. xxiv+762 pp. ISBN 0-12-192350-9. MR 1150683.
- v
- t
- e
Complementarity problems and algorithms
- Linear programming (LP)
- Quadratic programming (QP)
- Linear complementarity problem (LCP)
- Mixed linear (MLCP)
- Mixed (MCP)
- Nonlinear (NCP)
- Simplex (Dantzig)
- Revised simplex
- Criss-cross
- Lemke
This applied mathematics-related article is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e