Feasibility of a penalty cluster point
ProvedVectorSpaceOpt.penalty_cluster_point_feasiblecluster-pointfeasibilitylower-semicontinuitysubsequence
Let x₀ be the limit of a subsequence x ∘ phi, where phi is strictly increasing. Suppose the scalar constraint violation v is lower semicontinuous at x₀ and v (x n) tends to zero along the original sequence. Then x₀ is feasible:
Lower semicontinuity forces v x₀ ≤ 0, while the finite sum-of-squares definition is nonnegative and vanishes exactly when every positive part is zero. The theorem isolates the feasibility half of §10.11, Theorem 1 and makes the source's phrase “limit point” precise through an explicit convergent subsequence rather than assuming convergence of the full penalty-minimizer sequence.
Preamble
import Definitions.Def_VectorSpaceOpt_quadratic_penalty open Filter
Formal statement
namespace VectorSpaceOpt
/-- The feasibility half of Luenberger, Chapter 10, §10.11, Theorem 1. -/
theorem penalty_cluster_point_feasible
{X : Type*} [TopologicalSpace X] {p : ℕ} (G : X → Fin p → ℝ)
(x : ℕ → X) (x₀ : X) (phi : ℕ → ℕ)
(hphi : StrictMono phi)
(hxlim : Tendsto (x ∘ phi) atTop (nhds x₀))
(hvlsc : LowerSemicontinuousAt (constraintViolation G) x₀)
(hvlim : Tendsto (fun n => constraintViolation G (x n)) atTop (nhds 0)) :
IsConstraintFeasible G x₀ := by
sorry
end VectorSpaceOptSource
David G. Luenberger, Optimization by Vector Space Methods (Wiley, 1969), Chapter 10, §10.11, feasibility part of Theorem 1, printed p. 306 (physical PDF p. 324). Scan: https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf