Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.2 case (b.1) and (23), p. 492 — x̄ = x* + γw with ‖x̄‖ = r, γ ≠ 0, has f(x̄) = f(x*) + (γ²/2)⟨w, (A + λ*I)w⟩ < f(x*)

Proved
TaoAnDCA.Restart.restart_case_b1

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

kuhn-tuckernegative-curvaturep2o-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, f(x)=12⟨x,Ax⟩+⟨b,x⟩f(x)=\tfrac12\langle x,Ax\rangle+\langle b,x\ranglef(x)=21​⟨x,Ax⟩+⟨b,x⟩, and let x∗x^*x∗ be a Kuhn–Tucker point of min⁡{f(x):∥x∥≤r}\min\{f(x):\|x\|\le r\}min{f(x):∥x∥≤r} with multiplier λ∗\lambda^*λ∗. Let w∈Rnw\in\mathbb R^nw∈Rn be a direction of negative curvature, ⟨w,(A+λ∗I)w⟩<0\langle w,(A+\lambda^*I)w\rangle<0⟨w,(A+λ∗I)w⟩<0, and assume that either ∥x∗∥<r\|x^*\|<r∥x∗∥<r, or ∥x∗∥=r\|x^*\|=r∥x∗∥=r and wTx∗≠0w^Tx^*\ne0wTx∗=0. Let γ\gammaγ be given by (23),

γ={−2(wTx∗)/∥w∥2if ∥x∗∥=r,(−(wTx∗)±Δ)/∥w∥2if ∥x∗∥<r,Δ=(wTx∗)2−∥w∥2(∥x∗∥2−r2),\gamma=\begin{cases}-2(w^Tx^*)/\|w\|^2 & \text{if } \|x^*\|=r,\\ \bigl(-(w^Tx^*)\pm\sqrt\Delta\bigr)/\|w\|^2 & \text{if } \|x^*\|<r,\end{cases}\qquad \Delta=(w^Tx^*)^2-\|w\|^2(\|x^*\|^2-r^2),γ={−2(wTx∗)/∥w∥2(−(wTx∗)±Δ​)/∥w∥2​if ∥x∗∥=r,if ∥x∗∥<r,​Δ=(wTx∗)2−∥w∥2(∥x∗∥2−r2),

with either choice of sign. Then γ≠0\gamma\ne0γ=0, γ\gammaγ solves ∥w∥2γ2+2wTx∗γ+∥x∗∥2−r2=0\|w\|^2\gamma^2+2w^Tx^*\gamma+\|x^*\|^2-r^2=0∥w∥2γ2+2wTx∗γ+∥x∗∥2−r2=0, the point xˉ=x∗+γw\bar x=x^*+\gamma wxˉ=x∗+γw satisfies ∥xˉ∥=r\|\bar x\|=r∥xˉ∥=r, and

f(xˉ)=f(x∗)+γ22⟨w,(A+λ∗I)w⟩<f(x∗).f(\bar x)=f(x^*)+\frac{\gamma^2}{2}\langle w,(A+\lambda^*I)w\rangle<f(x^*).f(xˉ)=f(x∗)+2γ2​⟨w,(A+λ∗I)w⟩<f(x∗).

With w=uw=uw=u an eigenvector for an eigenvalue λ1\lambda_1λ1​ with λ∗+λ1<0\lambda^*+\lambda_1<0λ∗+λ1​<0, (21) gives the curvature hypothesis and this is the paper's case (b.1); with w=vw=vw=v from case (b.2) it is the paper's "Return to (b.1) with vvv instead of uuu".

Formalization Note The statement is for a general direction www with ⟨w,(A+λ∗I)w⟩<0\langle w,(A+\lambda^*I)w\rangle<0⟨w,(A+λ∗I)w⟩<0 rather than for the eigenvector uuu, because case (b.2) applies it to a vector that is not an eigenvector. The heading "⟨b,x∗⟩≤0\langle b,x^*\rangle\le0⟨b,x∗⟩≤0" of case b) is not assumed: the computation of (b.1) does not use it, so the statement is stronger than the page. The sign s=±1s=\pm1s=±1 selects the root in (23).

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

theorem restart_case_b1 {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)
    (w : EuclideanSpace ℝ (Fin n)) (hw : inner ℝ w (A w + lamStar • w) < 0)
    (hcase : ‖xs‖ < r ∨ (‖xs‖ = r ∧ inner ℝ w xs ≠ 0)) (s : ℝ) (hs : s = 1 ∨ s = -1) :
    restartGamma w xs r s ≠ 0 ∧
      ‖w‖ ^ 2 * restartGamma w xs r s ^ 2 + 2 * inner ℝ w xs * restartGamma w xs r s
        + ‖xs‖ ^ 2 - r ^ 2 = 0 ∧
      ‖xs + restartGamma w xs r s • w‖ = r ∧
      TaoAnDCA.TRS.quad A b (xs + restartGamma w xs r s • w) =
        TaoAnDCA.TRS.quad A b xs + restartGamma w xs r s ^ 2 / 2 * inner ℝ w (A w + lamStar • w) ∧
      TaoAnDCA.TRS.quad A b (xs + restartGamma w xs r s • w) < 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. 492, §4.2, case (b.1), (23)
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