Theorem 4.1, pp. 480–481 — on a compact level set where f is continuous, essentially cyclic BCD is defined and bounded; (a)–(c) on its cluster points
ProvedTsengBCD.Stationary.theorem_4_1Let never take the value and let . Assume that the level set
is compact and that is continuous on . Then the sequence generated by the BCD method is defined (for every choice of blocks, the minimizations (2) can be carried out), and every such sequence generated with the essentially cyclic rule is bounded. Moreover:
- (a) If is pseudoconvex in for every and is regular at every , then every cluster point of (essentially cyclic rule) is a stationary point of .
- (b) If is pseudoconvex in for every , is regular at every , and the cyclic rule is used, then every cluster point of is a stationary point of .
- (c) If has at most one minimum in for and the cyclic rule is used, then every cluster point of is a coordinatewise minimum point of ; if in addition is regular at , then is a stationary point of .
Here means . Theorem 4.1 unifies and extends results of Auslender for the convex nondifferentiable case and of Grippo–Sciandrone, Luenberger and Zadeh for the differentiable case.
Formalization Note. "Defined" is formalized as: for every index sequence a BCD run from exists (stronger than for essentially cyclic sequences only). " is continuous on " is formalized as continuity of , as a map into , at every point of ; under the weaker reading (continuity of the restriction ) the printed statement is false, by an explicit two-block counterexample given in the mission description. Blocks are 0-based: paper block is Lean index , is , is . s r is the block chosen at iteration ; the cyclic rule is s r = r mod N; the subsequence is . Pseudoconvexity in and "at most one minimum in " are read blockwise, as defined in the definitions item.
import Mathlib import Definitions.Def_TsengBCD_Stationary_Setting
namespace TsengBCD.Stationary
open Filter Topology
theorem theorem_4_1 {N : ℕ} [NeZero N] {n : Fin N → ℕ} (f : X n → EReal)
(hbot : ∀ x, f x ≠ ⊥) (x0 : X n) (hx0 : f x0 ≠ ⊤) (hcpt : IsCompact (levelSet f x0))
(hcont : ∀ y ∈ levelSet f x0, ContinuousAt f y) :
-- defined: for every index sequence a BCD run from x⁰ exists
(∀ s : ℕ → Fin N, ∃ x : ℕ → X n, x 0 = x0 ∧ IsBCDRun f s x) ∧
-- bounded
(∀ (s : ℕ → Fin N) (x : ℕ → X n), IsEssCyclic s → x 0 = x0 → IsBCDRun f s x →
Bornology.IsBounded (Set.range x)) ∧
-- (a)
((∀ i k : Fin N, PseudoconvexIn f {k, i}) → (∀ y ∈ levelSet f x0, IsRegularAt f y) →
∀ (s : ℕ → Fin N) (x : ℕ → X n), IsEssCyclic s → x 0 = x0 → IsBCDRun f s x →
∀ z, MapClusterPt z atTop x → IsStationary f z) ∧
-- (b)
((∀ i k : Fin N, i.val < N - 1 → k.val < N - 1 → PseudoconvexIn f {k, i}) →
(∀ y ∈ levelSet f x0, IsRegularAt f y) →
∀ (s : ℕ → Fin N) (x : ℕ → X n), IsCyclic s → x 0 = x0 → IsBCDRun f s x →
∀ z, MapClusterPt z atTop (fun m : ℕ => x (N * m + (N - 1))) → IsStationary f z) ∧
-- (c)
((∀ k : Fin N, 1 ≤ k.val → k.val < N - 1 → AtMostOneMinIn f k) →
∀ (s : ℕ → Fin N) (x : ℕ → X n), IsCyclic s → x 0 = x0 → IsBCDRun f s x →
∀ z, MapClusterPt z atTop (fun m : ℕ => x (N * m + (N - 1))) →
IsCoordMin f z ∧ (IsRegularAt f z → IsStationary f z)) := by sorry
end TsengBCD.Stationary
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.