Variational principle Created 2026-10-20 Updated 2026-10-31
A variational principle specifies a function, path or field by requiring a functional to be stationary under an allowed class of variations. The admissible class includes the prescribed boundary conditions and constraints. A stationary value need not be a minimum: the Euler-Lagrange equation expresses the first-order stationarity condition, while a minimum requires additional analysis. Fermat principle applies this idea to optical path length, and the Rayleigh-Ritz method approximates a variational problem in a chosen family of trial functions.
Variational problem Created 2026-10-06 Updated 2026-10-07
A variational problem seeks a stationary point or minimizer of a functional on a specified function space. For a symmetric coercive bilinear form and bounded linear functional on a real Hilbert space, minimizing is equivalent to the weak formulation for every test vector. The Lax-Milgram theorem gives a unique solution, and proves unique minimization. Specifying the admissible space and its boundary constraints is part of the problem.
Variational regularization Created 2026-09-24 Updated 2026-11-05
Variational regularization reconstructs an unknown by balancing data fit with a penalty expressing desired structure. A standard model is
The linear operator predicts data, denotes observations, and the extended-real functional can impose smoothness, sparsity or hard constraints. This construction includes nonlinear reconstruction maps even when itself is linear.[ref]
For , the model is quadratic Tikhonov regularization. For , the penalty controls the total variation seminorm on a domain and can retain jumps without demanding a square-integrable classical gradient. Adding the indicator functional of a constraint set enforces constraints such as nonnegativity.
Existence, uniqueness and stability are separate conclusions. A direct method in the calculus of variations requires suitable compactness of bounded-energy sets and lower semicontinuity; convexity alone does not supply compactness. A unique minimizer at fixed also does not prove convergence to the true object as noise vanishes: the regularization parameter choice must balance bias and noise.