Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.2 "Summing up", p. 493 — a Kuhn–Tucker point x* with an eigenpair (λ₁, u), λ* + λ₁ < 0, admits x̄ with ‖x̄‖ ≤ r and f(x̄) < f(x*)

Proved
TaoAnDCA.Restart.restart_exists

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

global-optimalitykuhn-tuckerp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1restarttrust-region

Let AAA be a real symmetric n×nn\times nn×n matrix, b∈Rnb\in\mathbb R^nb∈Rn, r>0r>0r>0, and f(x)=12⟨x,Ax⟩+⟨b,x⟩f(x)=\tfrac12\langle x,Ax\rangle+\langle b,x\ranglef(x)=21​⟨x,Ax⟩+⟨b,x⟩. Let x∗x^*x∗ be a Kuhn–Tucker point of the trust-region subproblem min⁡{f(x):∥x∥≤r}\min\{f(x):\|x\|\le r\}min{f(x):∥x∥≤r} with multiplier λ∗\lambda^*λ∗: λ∗≥0\lambda^*\ge0λ∗≥0, (A+λ∗I)x∗=−b(A+\lambda^*I)x^*=-b(A+λ∗I)x∗=−b, λ∗(∥x∗∥−r)=0\lambda^*(\|x^*\|-r)=0λ∗(∥x∗∥−r)=0, ∥x∗∥≤r\|x^*\|\le r∥x∗∥≤r. Let u≠0u\ne0u=0 be an eigenvector of AAA, Au=λ1uAu=\lambda_1uAu=λ1​u, with

λ∗+λ1<0.\lambda^*+\lambda_1<0 .λ∗+λ1​<0.

Then there exists xˉ∈Rn\bar x\in\mathbb R^nxˉ∈Rn with

∥xˉ∥≤randf(xˉ)<f(x∗).\|\bar x\|\le r\qquad\text{and}\qquad f(\bar x)<f(x^*).∥xˉ∥≤randf(xˉ)<f(x∗).

In §4.2 the condition λ∗+λ1<0\lambda^*+\lambda_1<0λ∗+λ1​<0, with λ1\lambda_1λ1​ the smallest eigenvalue of AAA, is the test that detects a Kuhn–Tucker point which is not a global solution; this theorem says that such a point can always be improved, so the DCA can be restarted from a strictly better feasible point. That is the basis of the paper's global algorithm GDCA.

Formalization Note The page speaks of the smallest eigenvalue λ1\lambda_1λ1​ and of a point "produced by the DCA"; neither is used, so the statement holds for every Kuhn–Tucker point and every eigenpair with λ∗+λ1<0\lambda^*+\lambda_1<0λ∗+λ1​<0, which is stronger. The hypothesis is the paper's test λ∗+λ1<0\lambda^*+\lambda_1<0λ∗+λ1​<0, not "x∗x^*x∗ is not a global solution", which would make the conclusion a restatement of the hypothesis.

Preamble
import Mathlib
import Definitions.Def_TaoAnDCA_Restart_Setting
Formal statement
namespace TaoAnDCA.Restart

theorem restart_exists {n : ℕ} (A : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n)) (hA : IsSelfAdjoint A)
    (b : EuclideanSpace ℝ (Fin n)) (r : ℝ) (hr : 0 < r)
    (xs : EuclideanSpace ℝ (Fin n)) (lamStar : ℝ) (hkkt : TaoAnDCA.TRS.IsKKT A b r xs lamStar)
    (lam1 : ℝ) (u : EuclideanSpace ℝ (Fin n)) (hu : u ≠ 0) (hAu : A u = lam1 • u) (hneg : lamStar + lam1 < 0) :
    ∃ xbar : EuclideanSpace ℝ (Fin n), ‖xbar‖ ≤ r ∧ TaoAnDCA.TRS.quad A b xbar < TaoAnDCA.TRS.quad A b xs := by sorry

end TaoAnDCA.Restart
Source
Pham Dinh & Le Thi, A d.c. optimization algorithm for solving the trust-region subproblem, SIAM J. Optim. 8 (1998), p. 493, §4.2, "Summing up" (with (21), p. 491)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me