Jump to content

Convex optimization

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 217.107.128.62 (talk) at 12:52, 31 March 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Convex optimization problem: f(x)->min, where f(x)-convex function, x - point of linspace X, g1(x)=0,...,gm(x)=0, where gi(x)-convex function.

See, Kuhn-Tacker theorm