Convexity of the perturbation value
ProvedVectorSpaceOpt.perturbationValue_convexcone-convexityconvex-analysisepigraphperturbation
Let be convex on and let be cone-convex there with respect to . For the extended-real perturbation value , the finite-height epigraph
is convex. This epigraph formulation expresses convexity without performing ambiguous arithmetic between and and includes infeasible and unbounded perturbations. It is the source-faithful extended-value version of Luenberger's assertion that is convex. The milestone makes the geometry of right-hand-side perturbations available to later supporting-functional and multiplier arguments and can be reused for general conic value functions. No finite-value hypothesis is hidden in the statement.
Preamble
import Definitions.Def_VectorSpaceOpt_coneConvexOn import Definitions.Def_VectorSpaceOpt_perturbationValue
Formal statement
namespace VectorSpaceOpt
/-- Luenberger, Chapter 8, §8.3, Proposition 1, expressed by convexity of the
finite-height epigraph of the extended-real perturbation value. -/
theorem perturbationValue_convex
{X Z : Type*}
[AddCommGroup X] [Module ℝ X]
[NormedAddCommGroup Z] [NormedSpace ℝ Z]
(P : ConvexCone ℝ Z) (Ω : Set X) (f : X → ℝ) (G : X → Z)
(hf : ConvexOn ℝ Ω f) (hG : ConeConvexOn P Ω G) :
Convex ℝ {p : Z × ℝ |
perturbationValue P Ω f G p.1 ≤ (p.2 : EReal)} := by sorry
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.3, Proposition 1, printed p. 216; physical PDF p. 236. Lean expresses the proposition by convexity of the finite-height epigraph of the EReal-valued ω.