Take a minimizing sequence for the variational regularization functional
Its coercivity makes the sequence bounded. Since is a reflexive Banach space, a subsequence converges weakly to some . A convex norm-lower-semicontinuous functional has weak lower semicontinuity, so this applies to both and the convex continuous map . Therefore
and is a minimizer. This is the direct method in the calculus of variations.
An element is a -minimizing solution when
It satisfies the source condition in variational regularization when there is a such that
where is the subdifferential of the convex functional .
Let minimize the nonsquared-residual objective. Comparison with gives
The source subgradient inequality gives
Consequently,
Thus for
every forces . The original comparison then gives , so is itself -minimizing. If is strictly convex, its restriction to the affine solution set has at most one minimizer, hence . This is an exact penalty method.
For , the Bregman divergence is
Put and , so . Comparison with gives
Using ,
For the last coefficient is negative, so
The estimate holds for any fixed admissible ; it does not require with the noise level.
The exact solution is feasible because
The feasible set is convex and weakly closed. A minimizing sequence has bounded residual and bounded ; the coercivity assumption from part (a), applied to a fixed positive weighted objective, makes it bounded in . Reflexivity gives a weakly convergent subsequence, and weak lower semicontinuity of the residual and keeps its limit feasible and minimizing.
Since minimizes over ,
The source condition in variational regularization and feasibility then yield
Thus the claimed constant is .

Articles by others on the same topic (0)

There are currently no matching articles.