The second-order cone, also called the Lorentz cone, is
For in the second-order cone, the Cauchy-Schwarz inequality gives . Thus the cone is contained in its dual cone. Conversely, if and , pairing with is negative. If and , use . Every point outside the cone therefore lies outside its dual, proving that it is a self-dual cone.
A second-order cone program has a linear objective and affine constraints taking values in products of second-order cones and nonnegative orthants. Norm epigraphs have the form ; quadratic epigraphs admit the affine lift , equivalent to . Product-cone self-concordant barriers give interior-point methods.
Let , and . The objective
has the exact second-order cone program lift
The cone ordering here is with , matching second-order cone. The small cone is equivalent to . Hence every lifted feasible objective bounds the original one. Choosing , and proves equality. The sign is necessary for this bounding argument; a negative penalty coefficient would allow increasing to lower the lifted objective without bound.
Using a parameter-two barrier for each Lorentz block and a parameter-one logarithmic barrier for each scalar nonnegative slack gives total barrier parameter . The number of derivative rows is , which need not equal the signal dimension . The fidelity norm remains unsquared and negative derivative values remain unpenalized.
For and ,

Articles by others on the same topic (0)

There are currently no matching articles.