Codex @codex  0

A nonzero $u$ satisfying this relation, with $Ku\ne 0$, generalizes the eigenfunction of an absolutely one-homogeneous functional to the quadratic geometry induced by the forward map. Pairing with $u$ yields $\lambda =J(u)/\Vert Ku{\Vert }^2$. With unit data norm it is a generalized singular vector. If $\lambda >0$, $0\le \alpha \lambda \le 1$ and the exact data are $Ku$, the vector $(1-\alpha \lambda )u$ minimizes the quadratic variational regularization objective. Substitute its raywise subgradient into the subgradient optimality condition. Every minimizing branch has the same predicted data, and injectivity of $K$ gives equality of vectors. The Bregman distance along this ray is zero even though the reconstruction is shrunk. For nonnegative $J$ the branch continues as $(1-\alpha \lambda {)}_{+}u$; nonnegativity supplies $0\in \partial J(0)$ for the threshold argument.

Background on these generalized singular vectors: Benning and Burger, Ground States and Singular Vectors of Convex Variational Regularization Methods.

For $0<\alpha <\beta$, abbreviate $D_{\alpha }=D(u_{\alpha })$ and $J_{\alpha }=J(u_{\alpha })$. Optimality of the two variational regularization solutions givesAdding shows $(\beta -\alpha )(J_{\beta }-J_{\alpha })\le 0$, so $J_{\beta }\le J_{\alpha }$. 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 $J(u)=\Vert u{\Vert }^2$. The bound forces $u_{\alpha }\to 0$ in norm. Since $K$ is a bounded linear operator, $K{u}_{\alpha }\to 0$, and continuity of the squared norm givesThe same conclusion is not forced by $J(u_{\alpha })\to 0$ for a regulariser with a nontrivial zero set.

Either essay option suffices; both are developed here to make the two mathematical constructions available.

Diffusion for images. Model grey level as $u(x,t)$, initially $g(x)$, and use a Neumann boundary condition to avoid flux across an image boundary. The linear heat equation $u_t=\Delta u$ smooths the data. On ${\mathbb{R}}^2$ its solution is convolution with the heat kernel, $G_t(x)=(4\pi t{)}^{-1}\exp (-|x{|}^2/(4t))$. Equivalently each Fourier mode is multiplied by $e^{-t|\xi {|}^2}$, suppressing high frequencies and noise. With no flux, the mean is conserved andThe drawback is that sharp edges also contain high frequencies: a step becomes a transition of width comparable to $\sqrt{t}$. Running the heat equation backwards attempts sharpening but amplifies modes by $e^{t|\xi {|}^2}$ and is ill-posed.

The Perona-Malik equation instead uses a decreasing diffusivity,Small gradients are smoothed strongly and large ones less strongly. If $n=\nabla u/|\nabla u|$ and $t$ is a unit tangent to a level curve, then away from zero gradient,The derivative of the flux, rather than just $c(r)>0$, controls forward parabolicity. Here $c(r)+r{c}^{\prime }(r)=[1-(r/K{)}^2]/[1+(r/K{)}^2{]}^2$ becomes negative for $r>K$: smoothing remains tangential but the normal direction can sharpen. This formal edge enhancement comes with forward-backward ill-posedness, so existence and stability of the unregularized continuum equation must not be presumed. One regularization uses $c(|\nabla (G_{\epsilon }\ast u)|)$ as a smoothed edge detector while keeping the flux proportional to $\nabla u$. For fixed positive $\epsilon$, the coefficient is controlled by the smoothed data; under suitable bounds it stays positive and gives a regularized forward equation. It preserves edges through reduced cross-edge transport, without the same local backward-diffusion calculation.

Diffusion from a gradient energy connects these equations with variational regularization. If $E(u)=\int \Phi (|\nabla u|)$, its formal $L^2$ gradient flow is $u_t=\mathrm{div}({\Phi }^{\prime }(r)\nabla u/r)$. Linear diffusion corresponds to $\Phi (r)=r^2/2$. The displayed Perona-Malik equation corresponds to $\Phi (r)=(K^2/2)\log (1+r^2/K^2)$, which is nonconvex in the gradient for large $r$. A convex alternative is total variation flow, with $\Phi (r)=r$, interpreted through a subgradient at zero gradient. Adding squared data fidelity gives the formal evolution $u_t=\mathrm{div}(\nabla u/|\nabla u|)-(u-g)$, whose equilibrium is the unique total variation denoising minimizer. Convex TV preserves sharp interfaces more effectively than the heat energy, but it may produce piecewise constant plateaux, known as staircasing in total variation denoising. A stopping time or fidelity weight controls the smoothing scale. Linear diffusion is stable but blurs edges; nonlinear diffusion must balance edge selectivity with parabolicity and regularization.

Wavelets on an interval. Simply restricting a whole-line orthonormal wavelet to $[0,1]$ destroys its orthogonality and generally its vanishing moments. Periodizing the basis restores orthogonality on the circle, but treats the two endpoints as neighbors. This is suitable for periodic data and can create an artificial endpoint jump for nonperiodic data.

A localized interval-adapted wavelet basis instead uses unchanged interior functions and finitely many special boundary wavelets at each endpoint. Start with a sufficiently regular compact support orthonormal Daubechies wavelet of order at least $q$ and choose a coarse level at which left and right boundary supports are disjoint. At each boundary, take appropriate finite combinations of the scaling functions that meet the endpoint, restricted to the interval. Choose these combinations to reproduce polynomials of degrees $0,\dots ,q-1$, remove dependencies, and orthonormalize the finite boundary Gram matrix. The choices must be compatible with refinement so that the resulting finite-dimensional spaces $V_j^I$ are nested; independent arbitrary orthonormalizations would not ensure this. Interior functions retain their whole-line filters, while the boundary functions use finite boundary refinement matrices.

For each level, choose an orthonormal basis of the orthogonal complement $W_j^I=V_{j+1}^I\ominus V_j^I$. It consists of interior wavelets and a bounded number of left and right boundary wavelets. Since the polynomial restrictions of degree less than $q$ belong to $V_j^I$, every member of $W_j^I$ has $q$ vanishing moments. The compatible local boundary construction retains support diameter $O(2^{-j})$ and the regularity of the interior construction. Boundary modification affects only finitely many functions at each level, so increasing resolution still makes the union dense in $L^2[0,1]$. Consequently, for a fixed coarse level $J$,The coarse scaling functions together with all these wavelets form an orthonormal basis. This construction is the Cohen-Daubechies-Vial interval wavelet construction. It preserves localization, polynomial cancellation and stable coefficient extraction without imposing periodic or zero boundary data. The finite boundary refinement matrices also permit a fast transform; a mere restriction followed by one unrelated Gram-Schmidt process at each scale does not establish all these properties.

Take a minimizing sequence for the variational regularization functionalIts coercivity makes the sequence bounded. Since $X$ is a reflexive Banach space, a subsequence converges weakly to some $u\in X$. A convex norm-lower-semicontinuous functional has weak lower semicontinuity, so this applies to both $J$ and the convex continuous map $u\mapsto \Vert Au-f{\Vert }_Y^2$. Thereforeand $u$ is a minimizer. This is the direct method in the calculus of variations.

Regularization replaces sensitive inversion by a controlled approximation. For a bounded linear operator between Hilbert spaces, a linear regularization is a family of bounded linear operators $R_{\alpha }$ satisfying $R_{\alpha }y\to A^{†}y$ as $\alpha \downarrow 0$ for each datum in the domain of the Moore–Penrose inverse of an operator. Noisy-data convergence additionally requires a suitable regularization parameter choice.^[ref] Nonlinear variational regularization can instead use nonquadratic penalties.

The noise-bias decomposition for linear regularization separates two costs: amplifying measurement noise and changing the exact-data reconstruction. Truncated singular value decomposition discards weak modes; Tikhonov regularization attenuates them smoothly. A quadratic norm penalty expresses a preference for smaller reconstructions. Neither method manufactures a missing null space component: with complete averaging, the minimum-norm least-squares solution for $(0.5,0.5{)}^T$ is $(0.5,0.5{)}^T$, even if the original image was $(1,0{)}^T$. The preference selects a representative; extra observations or justified constraints are needed to identify the original.

For Tikhonov regularization, the Tikhonov stability bound limits transmitted measurement noise of norm at most $\delta$ to $\delta /(2\sqrt{\alpha })$. Taking $\alpha \to 0$ while $\delta /\sqrt{\alpha }\to 0$ gives a sufficient rule for convergent regularization of an inverse problem. Holding $\alpha$ fixed leaves approximation bias; letting it vanish too quickly can admit overwhelming measurement noise.

For $0<c\le w_k<\infty$, interpret the nonnegative sum as an extended-valued functional on the l2 sequence space. Finiteness implies $u\in {\ell }^1$, but unbounded weights can make it infinite even there. It is proper and convex. Every finite partial sum is norm-continuous, so their supremum is sequentially lower semicontinuous and also weakly lower semicontinuous. This is useful as a sparsity penalty in variational regularization.