Power cone

In linear algebra, a power cone is a kind of a convex cone that is particularly important in modeling convex optimization problems.[1] It is a generalization of the quadratic cone: the quadratic cone is defined using a quadratic equation (with the power 2), whereas a power cone can be defined using any power, not necessarily 2.

Definition

The n-dimensional power cone is parameterized by a real number $0<r<1$ . It is defined as:[1]

$P_{n,r,1-r}:=\left\{\mathbf {x} \in \mathbb {R} ^{n}:~~x_{1}\geq 0,~~x_{2}\geq 0,~~x_{1}^{r}\cdot x_{2}^{1-r}\geq {\sqrt {x_{3}^{2}+\cdots +x_{n}^{2}}}\right\}$

Applications

The main application of the power cone is in constraints of convex optimization programs. There are many problems that can be described as minimizing a convex function over a power cone.[1]

References

"MOSEK Modeling Cookbook - the Power Cones".

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[:0-1] "MOSEK Modeling Cookbook - the Power Cones".