The fidelity norm here is unsquared, as in the original PDF. Write , so . Introduce and . The second-order cone reformulation of one-sided quadratic denoising is
subject to the affine cone constraints
where is the second-order cone. All coordinates displayed inside the cone memberships are affine in the optimization variables, so stacking them has precisely the form . The first cone enforces , and each three-dimensional cone enforces . The two scalar inequalities give .
Every feasible lift therefore has objective at least the original objective. Conversely, for any , choose , and to attain equality. Thus the reformulation is exact. It is a second-order cone program over the product , a proper closed self-dual cone. It preserves the asymmetric derivative penalty; replacing it by would change the problem.
The canonical Lorentz-cone barrier is on , and each orthant coordinate contributes . Their sum, composed with the affine slack map, is
Its domain explicitly requires , , and ; the positive Lorentz branch must not be inferred merely from positivity of a squared expression. The barrier parameter of the product-cone barrier is , with two per Lorentz block and one per scalar orthant slack. A strict feasible lift can always be obtained by choosing above both bounds, above , and above the fidelity norm.

Articles by others on the same topic (0)

There are currently no matching articles.