VectorSpaceOpt.lagrangeDualValue
DefinitionVectorSpaceOpt_lagrangeDualValuedefinitiondual-functionextended-reallagrangian
Let and fix an objective , a constraint map , and a continuous linear multiplier . The Lagrange dual value is the extended-real infimum
Lean takes an indexed infimum in EReal: it is when is empty and may be when the Lagrangian is unbounded below. The main theorem separately assumes is nonempty and identifies an attained multiplier whose value is the finite primal optimum. This definition preserves the boundary cases needed for a genuine dual function and is reusable independently of strong duality.
Definition code
import Definitions.Def_VectorSpaceOpt_lagrangian
namespace VectorSpaceOpt
/-- The possibly infinite Lagrange dual value, as an infimum over `Ω`. -/
noncomputable def lagrangeDualValue
{X Z : Type*} [NormedAddCommGroup Z] [NormedSpace ℝ Z]
(Ω : Set X) (f : X → ℝ) (G : X → Z) (zstar : Z →L[ℝ] ℝ) : EReal :=
⨅ x : Ω, ((lagrangian f G zstar x : ℝ) : EReal)
end VectorSpaceOptSource
David G. Luenberger, Optimization by Vector Space Methods, Wiley, 1969, public scan https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf, Chapter 8, §8.6, definition of φ(z*), printed p. 223; physical PDF p. 243.