Proposition 3.3 (first claim) — exactness implies (3.3): minimizes the relaxation
ProvedRockafellianRelax.proposition_3_3_aoptimizationp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-optimizationvariational-analysis
Let be a Rockafellian for the problem of minimizing . If is exact, supported by , then for every ,
Differences from the source:
- encoding: ℝᵐ × ℝⁿ, values in R̄ = [−∞, ∞], ⟨y, u⟩ → (Fin m → ℝ) × (Fin n → ℝ) with the product topology, EReal, y ⬝ᵥ u; reason: Lean convention; same instances (the product topology has the same convergent sequences as the Euclidean norm)
Preamble
import Mathlib import Definitions.Def_RockafellianRelax_IsExact import Definitions.Def_RockafellianRelax_argmin import Definitions.Def_RockafellianRelax_tilt
Formal statement
namespace RockafellianRelax
/-- **Proposition 3.3, first claim: exactness gives (3.3).** Royset, Chen & Eckstrand,
arXiv:2204.04762v4, Proposition 3.3, p.7: "Suppose f : ℝᵐ×ℝⁿ → R̄ is a Rockafellian for the problem
(3.1) of minimizing φ : ℝⁿ → R̄. If f is exact, supported by ȳ, then
x⋆ ∈ argmin_x φ(x) =⇒ (0, x⋆) ∈ argmin_{u,x} f(u, x) − ⟨ȳ, u⟩. (3.3)"
**Formalization Note.** `IsExact f φ ȳ` includes that `f` is a Rockafellian for `φ`. -/
theorem proposition_3_3_a {m n : ℕ} (f : (Fin m → ℝ) × (Fin n → ℝ) → EReal)
(φ : (Fin n → ℝ) → EReal) (ybar : Fin m → ℝ) (hex : IsExact f φ ybar) :
∀ xs : Fin n → ℝ, xs ∈ argmin φ → ((0 : Fin m → ℝ), xs) ∈ argmin (tilt f ybar) := by sorry
end RockafellianRelax
Source
Royset, Chen & Eckstrand, Rockafellian Relaxation and Stochastic Optimization under Perturbations, arXiv:2204.04762v4, Proposition 3.3, p.7, (3.3)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.