§3, p. 177 — Beale's simplex method for a convex quadratic function terminates
ProvedBealeConvexMin.QuadSimplex.iteration_terminatesConsider Beale's extension of the simplex method to minimizing a convex quadratic function of nonnegative variables subject to linear equations. The current state is a tableau: each restricted variable is written as in the nonbasic variables , which are restricted or free, and with .
Let the initial tableau have
- a symmetric matrix whose quadratic block is positive semidefinite (convexity of ), and
- consistent labels (each restricted nonbasic variable in exactly one slot, with the unit row).
Then there is no infinite sequence of tableaux starting at the given one such that each arises from by one step of the iteration and every basic restricted variable is strictly positive in the associated solution of every :
In the paper's words, "the iteration must terminate". Every run therefore reaches a tableau from which no step is possible; what such a tableau looks like (an absolute minimum, by the optimality criterion of p. 175, or a ray along which decreases indefinitely) is not part of this statement.
Formalization Note The paper keeps every of a basic variable positive with Charnes's -perturbations; here this is a hypothesis on the run rather than a perturbation scheme. The problem data enter only through the initial tableau, and phase 1 is out of scope. No bound on the number of steps is claimed, as in the paper.
import Mathlib import Definitions.Def_BealeConvexMin_QuadSimplex_pivotC import Definitions.Def_BealeConvexMin_QuadSimplex_Tableau import Definitions.Def_BealeConvexMin_QuadSimplex_BealeStep
namespace BealeConvexMin.QuadSimplex
/-- Beale (1955), §3, p. 177: the iteration for a convex quadratic `C` terminates. From an initial
tableau with symmetric `(c_kl)`, positive semidefinite quadratic block (convex `C`) and consistent
labels, there is no infinite run `T 0 → T 1 → ⋯` of steps along which every basic restricted
variable stays strictly positive in the associated solution (the ε-perturbation device of p. 174,
stated as a hypothesis on the run). -/
theorem iteration_terminates {n N : ℕ} (T₀ : Tableau n N) (hsymm : T₀.c.IsSymm)
(hpsd : (T₀.c.submatrix Fin.succ Fin.succ).PosSemidef) (hlab : LabelsConsistent T₀) :
¬ ∃ T : ℕ → Tableau n N, T 0 = T₀ ∧ (∀ k, BealeStep (T k) (T (k + 1))) ∧
∀ k, BasicPositive (T k) := by sorry
end BealeConvexMin.QuadSimplex
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.