First interpret the stated well-definedness as including uniqueness of the global minimizer for each positive parameter. Under that assumption, the parameter continuity of variational regularization follows from the direct method in the calculus of variations argument below.
Let . For large , . Comparison with zero, using , givesCoercivity of therefore bounds the sequence. Take a -convergent subsequence with limit . For any , optimality givesThe last two terms vanish. Sequential lower semicontinuity at the fixed parameter implies . Thus every cluster point is a global minimizer at . Uniqueness makes it , and the subsequence property provesIndeed, a subsequence staying outside a neighborhood of would have a further convergent subsequence, whose limit must be , a contradiction.
The listed existence hypotheses alone do not imply uniqueness or convergence of an arbitrary selection. For example, on , set , , andThis is nonnegative, convex, continuous and has ; every has coercivity. Its minimizers are for all . Along , selecting prevents convergence. Without uniqueness, the valid conclusion is that every cluster point minimizes the limiting objective.
Use the value function of variational regularization in its selection-independent formBecause , each objective is non-decreasing with , hence so is its infimum. For , the affine function of the parameter at each fixed givesThus is concave.
For continuity, on any interval , comparison using givesIt follows that is a locally Lipschitz function, hence continuous, on . Therefore the value function of variational regularization is non-decreasing, concave and continuous. No uniqueness of minimizers is needed for these conclusions.
For , abbreviate and . Optimality of the two variational regularization solutions givesAdding shows , so . Rearranging each comparison then gives the monotonicity of data fidelity and regularization penaltyHence the regulariser value is non-increasing and the data misfit is non-decreasing with the parameter. These inequalities hold for any choices of minimizers at the two distinct parameters, including when uniqueness fails.
Comparison with zero and nonnegativity of the two terms givesThereforeFor a concrete variational regularization example, take a Hilbert space and . The bound forces in norm. Since is a bounded linear operator, , and continuity of the squared norm givesThe same conclusion is not forced by for a regulariser with a nontrivial zero set.
The small-parameter limit depends on data compatibility with the regularizer domain. SetFor every such , optimality givesTaking the upper limit as and then the infimum over proves . Its two nonnegative contributions above must vanish, yielding the general resultIn particular, the requested zero-misfit limit holds when . A sufficient condition is an exact solution with and ; thenMembership of in alone is insufficient. Take , , , and the indicator functional of a constraint set . All positive-parameter objectives are proper extended-real functions with coercivity and sequential lower semicontinuity, with the unique minimizer , yet for every . Thus the first printed limit needs compatibility with the regulariser's effective domain; the second limit remains true under the given assumptions.
Articles by others on the same topic
There are currently no matching articles.