Basic quadratic-penalty estimates
ProvedVectorSpaceOpt.quadratic_penalty_basic_estimatesglobal-minimizermonotonicitypenalty-methodweighted-violation
Let positive weights be nondecreasing and tend to infinity. Suppose is a feasible global minimizer of , and for every , globally minimizes . Then the attained penalty values are nondecreasing, every one is at most , and the stronger weighted residual vanishes:
No topology, continuity, convergence, or convexity is assumed. This is exactly §10.11, Lemma 1, including its part 3 rather than the weaker consequence . The result supplies all numerical bounds consumed by the cluster-point theorem and can be reused for penalty sequences in any underlying decision type.
Preamble
import Definitions.Def_VectorSpaceOpt_quadratic_penalty open Filter Set
Formal statement
namespace VectorSpaceOpt
/-- Luenberger, Chapter 10, §10.11, Lemma 1. -/
theorem quadratic_penalty_basic_estimates
{X : Type*} {p : ℕ} (f : X → ℝ) (G : X → Fin p → ℝ)
(K : ℕ → ℝ) (x : ℕ → X) (xStar : X)
(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)) :
Monotone (fun n => quadraticPenaltyObjective f G (K n) (x n)) ∧
(∀ n, quadraticPenaltyObjective f G (K n) (x n) ≤ f xStar) ∧
Tendsto (fun n => K n * constraintViolation G (x n)) atTop (nhds 0) := by
sorry
end VectorSpaceOptSource
David G. Luenberger, Optimization by Vector Space Methods (Wiley, 1969), Chapter 10, §10.11, Lemma 1, printed p. 305 (physical PDF p. 323). Scan: https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf