Loading AI tools
Subfield of convex optimization From Wikipedia, the free encyclopedia
Conic optimization is a subfield of convex optimization that studies problems consisting of minimizing a convex function over the intersection of an affine subspace and a convex cone.
This article includes a list of general references, but it lacks sufficient corresponding inline citations. (October 2011) |
The class of conic optimization problems includes some of the most well known classes of convex optimization problems, namely linear and semidefinite programming.
Given a real vector space X, a convex, real-valued function
defined on a convex cone , and an affine subspace defined by a set of affine constraints , a conic optimization problem is to find the point in for which the number is smallest.
Examples of include the positive orthant , positive semidefinite matrices , and the second-order cone . Often is a linear function, in which case the conic optimization problem reduces to a linear program, a semidefinite program, and a second order cone program, respectively.
Certain special cases of conic optimization problems have notable closed-form expressions of their dual problems.
The dual of the conic linear program
is
where denotes the dual cone of .
Whilst weak duality holds in conic linear programming, strong duality does not necessarily hold.[1]
The dual of a semidefinite program in inequality form
is given by
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.