First use the usual Hilbert space convention for the proximal operator, identifying the dual element with its representing vector. For , completing the square gives
Set and multiply the objective by . Its variable part becomes . Thus the proximal operator under affine rescaling is
Negative is allowed. If and , the penalty is constant and the answer is . If and , is identically infinite, so there is no proper proximal problem.
The PDF actually assumes an arbitrary Banach space, so the Hilbert input shift cannot be asserted literally under its hypotheses. Define as a possibly empty or set-valued minimizer set. Absolute homogeneity of the norm still gives the valid change of variables
This retains the linear term, rather than shifting by a dual vector. Equivalently its optimality condition uses the duality mapping :
For a concrete failure of the Hilbert shortcut, take , , , and . Every with minimizes with value . The naive shifted answer has value zero and is not a minimizer. Hence the simple shifted formula requires Hilbert geometry; general Banach proximal minimizers need not be unique. For with finite constant penalty the Banach condition is , not generally .

Articles by others on the same topic (0)

There are currently no matching articles.