For a logarithmically homogeneous barrier on a proper cone, the convex conjugate with reversed argument defines a barrier on the interior dual cone. The inverse gradient relation makes equivalent to . This gives a joint primal-dual central path without assuming the barrier is identical on a self-dual cone.
Use the nonnegative-pairing dual cone . The Lagrangian is for . Its infimum over unrestricted is finite exactly when . Therefore the conic dual problem is
The final equality uses the self-dual cone assumption.
For the canonical self-concordant barrier, use its logarithmically homogeneous barrier normalization
At parameter , the primal barrier problem is
Write , the Legendre dual cone barrier. The matching dual barrier problem is
Defining the dual barrier this way is valid generally; self-duality of the cone alone does not assert that an arbitrarily selected barrier equals its Legendre dual.
The joint central path characterization is
The primal stationarity equation is , exactly the dual feasibility equation after defining . For the dual relation, logarithmic homogeneity gives , so . Thus dual stationarity is , giving the same primal equation. At these points,
Newton step. At a chosen target parameter , define
Linearizing the three equality conditions gives the central-path Newton system
Eliminating the slack and dual directions yields
The barrier Hessian is positive definite. Full column rank of therefore makes positive definite and the reduced solve unique. Use a damped step with and remaining interior; a full Newton step need not do so.
At an exact point with parameter , choosing gives and , the usual predictor towards the next path point. Infinitesimally,
The path definition presupposes interior feasibility and attainment of the barrier problems; strict primal-dual feasibility is a standard sufficient setting. The printed full-rank condition by itself is insufficient. For example , , and give the sole primal feasible point , with no interior slack at all, despite full column rank. Rank guarantees the Newton solve at an interior point, not existence of the central path.
Put . The image penalty is discrete isotropic total variation ; the fidelity term is the L1 norm . Introduce scalars and minimize the linear objective
subject to the following affine residuals being cone-feasible:
where is the Lorentz cone. Every component displayed is affine in , so stacking them gives exactly the requested form, with
The first two inequalities imply , so separate nonnegativity constraints for are unnecessary. The cone constraints imply . Every lifted feasible objective bounds the original objective from above; choosing and gives equality. Since both objective weights are positive, an optimum uses these tight values. Thus the lift is an exact second-order cone program for box-constrained TV-L1 denoising.
The product cone is proper, closed, convex and self-dual. The stacked has full column rank: the box rows recover , the fidelity rows then recover , and the first coordinates of the Lorentz blocks recover . Strict feasibility is also explicit: choose , then take and .
For generic cone slack , a canonical barrier is
on and . The positive sheet condition matters: positivity of the quadratic expression alone would also include the wrong Lorentz nappe.
Composing the barrier with the affine residual map gives
Its domain includes the strict inequalities above. Each orthant coordinate contributes one to the self-concordant barrier parameter and each Lorentz block contributes two. Therefore the product-cone logarithmically homogeneous barrier has
The affine composition is the barrier used in the primal variables; it need not itself be logarithmically homogeneous in because the image data and box offsets are affine constants.