Nonlinear complementarity problem

In applied mathematics, a nonlinear complementarity problem (NCP) with respect to a mapping ƒ : Rⁿ → Rⁿ, denoted by NCPƒ, is to find a vector x ∈ Rⁿ such that

x\geq 0,\ f(x)\geq 0{\text{ and }}x^{T}f(x)=0\,

where ƒ(x) is a smooth mapping.

References

Stephen C. Billups (2008). "A new homotopy method for solving non-linear complementarity problems". Retrieved 2010-03-13.
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

Complementarity problems and algorithms

Complementarity Problems	Linear programming (LP) Quadratic programming (QP) Linear complementarity problem (LCP) Mixed linear (MLCP) Mixed (MCP) Nonlinear(NCP)

Basis-exchange algorithms	Simplex (Dantzig) Revised simplex Criss-cross Lemke

This article is issued from Wikipedia - version of the 5/11/2014. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.