Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The linesearch (2.1) of Algorithm 2.1 terminates

Proved
SolodovSvaiterVI.Alg21.linesearch_well_defined

by mikedeng1 · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

line-searchp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1projection-methodsvariational-inequalities

Let CCC be a closed convex subset of Rn\mathbb{R}^nRn, F:Rn→RnF : \mathbb{R}^n \to \mathbb{R}^nF:Rn→Rn continuous, and γ,σ∈(0,1)\gamma, \sigma \in (0, 1)γ,σ∈(0,1). Let rrr be the projected residual of VI(F,C)\mathrm{VI}(F, C)VI(F,C). If x∈Cx \in Cx∈C and r(x)≠0r(x) \ne 0r(x)=0, then some nonnegative integer kkk satisfies the linesearch condition

⟨F(x−γkr(x)),r(x)⟩≥σ∥r(x)∥2.(2.1)\langle F(x - \gamma^k r(x)), r(x) \rangle \ge \sigma \|r(x)\|^2. \tag{2.1}⟨F(x−γkr(x)),r(x)⟩≥σ∥r(x)∥2.(2.1)

Consequently the smallest such kkk, the index kik_iki​ of Algorithm 2.1, exists, and every iteration of the method that has not stopped is well defined.

Formalization Note Stated for a generic point x∈Cx \in Cx∈C with nonzero residual rather than for an iterate xix^ixi.

Preamble
import Mathlib
import Definitions.Def_SolodovSvaiterVI_Alg21_ArmijoHolds
Formal statement
namespace SolodovSvaiterVI.Alg21

/-- Solodov–Svaiter, proof of Theorem 2.1, first paragraph (p. 769): the linesearch of
Algorithm 2.1 is well defined — at a point `x ∈ C` with `r(x) ≠ 0`, condition (2.1) holds for
some nonnegative integer `k`. -/
theorem linesearch_well_defined {n : ℕ}
    (F : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n))
    (C : Set (EuclideanSpace ℝ (Fin n))) (hCc : IsClosed C) (hCcv : Convex ℝ C)
    (hF : Continuous F) (gamma sigma : ℝ) (hγ0 : 0 < gamma) (hγ1 : gamma < 1)
    (hσ0 : 0 < sigma) (hσ1 : sigma < 1)
    (x : EuclideanSpace ℝ (Fin n)) (hx : x ∈ C) (hr : residual F C x ≠ 0) :
    ∃ k : ℕ, ArmijoHolds F C gamma sigma x k := by sorry

end SolodovSvaiterVI.Alg21
Source
Solodov & Svaiter, A New Projection Method for Variational Inequality Problems, SIAM J. Control Optim. 37 (1999), p. 769, proof of Theorem 2.1, first paragraph (Eqs. (2.4)–(2.5))
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me