Global minimizer 2026-10-05
A global minimizer is a point attaining the infimum of an objective. For an extended-real functional, it is usual to require a finite objective value; this excludes points outside its effective domain. A convention allowing as the attained value gives every point as a formal minimizer of the identically infinite function.
For , choosing global minimizers of and gives and . The decrease in penalty and increase in data misfit satisfy .
For objectives with and positive parameter, suppose nearby-parameter global minimizers have uniformly bounded penalty, stay in a bounded set with convergent subsequences, and and are sequentially lower semicontinuous in the chosen topology. Their optimality inequalities and lower semicontinuity show that every subsequential limit minimizes the limiting objective. Uniqueness makes the regularized solution continuous in the parameter. Existence alone does not make an arbitrary selection among multiple global minimizers continuous.
A finite-valued global minimizer of the functional is an element satisfying
Here is its effective domain. The finite-value convention avoids treating an infeasible problem as solved.
The functional is a proper extended-real function if its effective domain is nonempty; the specified codomain already excludes . It has coercivity if always implies , equivalently every finite sublevel set is bounded. It is -sequentially lower semicontinuous if
The topology in this definition matters: norm sequential lower semicontinuity and weak sequential lower semicontinuity need not coincide for a nonconvex functional.
On with its usual topology, the following examples isolate the three failures.
A nonproper functional is for every . Its effective domain is empty, so it has no finite-valued global minimizer. It nevertheless has coercivity and is sequentially lower semicontinuous. If a minimizer is instead defined only by without requiring finiteness, every point formally minimizes this function; under that convention the requested nonproper counterexample is impossible with the given codomain.
A noncoercive functional is . It is a proper extended-real function and is continuous, but its infimum zero is approached as and is never attained. Hence it has no global minimizer.
A failure of sequential lower semicontinuity is
It is a proper extended-real function with coercivity, but . Its infimum is zero, while every function value is positive. Thus it has no global minimizer.
To prove this, properness makes . First rule out : a sequence with eventually lies in a fixed sublevel set, which is bounded by coercivity. A -convergent subsequence would then have a limit with , contradicting the codomain. Hence is finite.
Choose a minimizing sequence with . It eventually belongs to the bounded sublevel set . Extract . By sequential lower semicontinuity,
Thus . In particular, a reflexive Banach space with the weak topology supplies the required subsequence property by weak sequential compactness of bounded sequences in a reflexive Banach space. A strictly convex function has at most one minimizer; this is an additional property, not part of the existence theorem.
Take the weak topology on the reflexive Banach space . A bounded linear operator is weak-to-weak continuous: implies for every , by its adjoint operator. The weak lower semicontinuity of the Hilbert norm therefore makes weakly sequentially lower semicontinuous.
This functional is finite everywhere and nonnegative. If it has coercivity, the direct method in the calculus of variations supplies a global minimizer . Squaring the residual does not change its global minimizers. Here the adjoint operator has codomain , since the source is a Banach space. Differentiating the squared residual along every real direction gives in the dual pairing, hence the normal equation for a linear inverse problem . Hence
The converse fails. For , , and , the datum is in the operator range, but while . Thus admissible data do not imply coercivity of the residual; an unpenalized null space already prevents it.
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 , gives
Coercivity of therefore bounds the sequence. Take a -convergent subsequence with limit . For any , optimality gives
The 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 proves
Indeed, 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 , , and
This 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.
Work in the real zero-boundary Sobolev space , whose members have square-integrable weak derivatives and zero endpoint trace. Define the bounded bilinear form and linear functional
The weak formulation is to find with for every . Integration by parts recovers the differential equation for a smooth solution; conversely, this identity is the definition of its weak solution.
Use the full norm. The Cauchy-Schwarz inequality gives and . Also , so is a coercive bilinear form with constant one. The Lax-Milgram theorem states that a bounded, coercive bilinear form on a real Hilbert space determines a unique weak solution for every bounded linear functional. It therefore applies here.
The equivalent minimization problem is
If is the weak solution, symmetry and give
This is positive unless , proving a unique global minimizer. Conversely, differentiating at gives the weak identity. Thus the unique energy minimizer is exactly the unique weak solution. As a check, the classical representative is
It satisfies both endpoint conditions and .
For the stated uniaxial nematic order normalization, the nematic director is an eigenvector of with eigenvalue , and the two perpendicular eigenvalues are . Therefore
Using precisely the Landau-de Gennes free energy convention in the preceding solution gives
If the quartic invariant were instead normalized as , its coefficient would be ; the physical predictions are unchanged after redefining .
For a nonzero global minimizer of the free energy, compare opposite values of the scalar nematic order parameter:
The lower one has , so
The claim concerns the stable ordered phase, not every metastable stationary point. For the two signs are degenerate. For , equality of the ordered and isotropic free energies, together with stationarity, gives and . The finite jump exhibits the first-order phase transition driven by the cubic invariant.