Quadratic penalty cluster-point convergence
ProvedVectorSpaceOpt.quadratic_penalty_cluster_point_convergescluster-pointconstrained-optimumlower-semicontinuityquadratic-penalty
Let be nondecreasing with . Assume is a feasible global solution of the constrained problem and each globally minimizes the quadratic-penalty objective . If and the composite violation are lower semicontinuous and a strictly indexed subsequence converges to , then
and globally minimizes over all feasible points. This is §10.11, Theorem 1 with “limit point” formalized explicitly. It assumes existence of penalty minimizers and a cluster point but does not assume convexity, differentiability, or convergence of the entire sequence.
Preamble
import Definitions.Def_VectorSpaceOpt_quadratic_penalty open Filter Set
Formal statement
namespace VectorSpaceOpt
/-- Luenberger, Chapter 10, §10.11, Theorem 1. -/
theorem quadratic_penalty_cluster_point_converges
{X : Type*} [TopologicalSpace X] {p : ℕ} (f : X → ℝ)
(G : X → Fin p → ℝ) (K : ℕ → ℝ) (x : ℕ → X)
(xStar x₀ : X) (phi : ℕ → ℕ)
(hKpos : ∀ n, 0 < K n) (hKmono : Monotone K)
(hKlim : Tendsto K atTop atTop)
(hfeasStar : IsConstraintFeasible G xStar)
(hminStar : IsMinOn f {y | IsConstraintFeasible G y} xStar)
(hpenMin : ∀ n, IsMinOn (quadraticPenaltyObjective f G (K n)) Set.univ (x n))
(hflsc : LowerSemicontinuous f)
(hvlsc : LowerSemicontinuous (constraintViolation G))
(hphi : StrictMono phi)
(hxlim : Tendsto (x ∘ phi) atTop (nhds x₀)) :
IsConstraintFeasible G x₀ ∧ f x₀ = f xStar ∧
IsMinOn f {y | IsConstraintFeasible G y} x₀ := by
sorry
end VectorSpaceOptSource
David G. Luenberger, Optimization by Vector Space Methods (Wiley, 1969), Chapter 10, §10.11, Theorem 1, printed p. 306 (physical PDF p. 324). Scan: https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf