Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1, (20), p. 491 — ∂h(x*) = {(ρI − A)x*} ⊂ ∂g(x*) iff x* is a Kuhn–Tucker point of (Q1)

Proved
TaoAnDCA.TRS.eq20_iff_kkt

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

dcakuhn-tuckerp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1subdifferentialtrust-region

Let AAA, bbb, r>0r>0r>0, ρ>0\rho>0ρ>0 and the decomposition (16) g(x)=12ρ∥x∥2+bTx+χE(x)g(x)=\frac12\rho\|x\|^2+b^Tx+\chi_E(x)g(x)=21​ρ∥x∥2+bTx+χE​(x), h(x)=12xT(ρI−A)xh(x)=\frac12x^T(\rho I-A)xh(x)=21​xT(ρI−A)x be as in the trust-region setting, with AAA symmetric and ρI−A\rho I-AρI−A positive semidefinite, and let x∗∈Ex^*\in Ex∗∈E, i.e. ∥x∗∥≤r\|x^*\|\le r∥x∗∥≤r. Then ∂h(x∗)={∇h(x∗)}={(ρI−A)x∗}\partial h(x^*) = \{\nabla h(x^*)\} = \{(\rho I-A)x^*\}∂h(x∗)={∇h(x∗)}={(ρI−A)x∗}, and the inclusion (20)

∂h(x∗)=∇h(x∗)⊂∂g(x∗)\partial h(x^*) = \nabla h(x^*)\subset\partial g(x^*)∂h(x∗)=∇h(x∗)⊂∂g(x∗)

holds if and only if there is a real λ∗≥0\lambda^*\ge0λ∗≥0 with

(A+λ∗I)x∗=−b,λ∗(∥x∗∥−r)=0,∥x∗∥≤r.(A+\lambda^*I)x^* = -b,\qquad\lambda^*(\|x^*\|-r) = 0,\qquad\|x^*\|\le r.(A+λ∗I)x∗=−b,λ∗(∥x∗∥−r)=0,∥x∗∥≤r.

This identifies the critical points that the DCA delivers for the decomposition (16) with the Kuhn–Tucker points of the trust-region subproblem.

Formalization Note. The Kuhn–Tucker conditions are the predicate IsKKT A b r x lam. The hypothesis ∥x∗∥≤r\|x^*\|\le r∥x∗∥≤r is where the page applies the equivalence: the limit points of the DCA lie in EEE.

Preamble
import Mathlib
import Definitions.Def_TaoAnDCA_TRS_Setting

open Filter Topology
Formal statement
namespace TaoAnDCA.TRS

theorem eq20_iff_kkt {n : ℕ} (A : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n)) (hA : IsSelfAdjoint A)
    (b : EuclideanSpace ℝ (Fin n)) (r : ℝ) (hr : 0 < r) (ρ : ℝ) (hρ : 0 < ρ)
    (hρA : ∀ z : EuclideanSpace ℝ (Fin n), 0 ≤ inner ℝ z (ρ • z - A z)) (xs : EuclideanSpace ℝ (Fin n)) (hxs : ‖xs‖ ≤ r) :
    TaoAnDCA.GlobalOpt.subdiff (hDec A ρ) xs = {ρ • xs - A xs} ∧
      (TaoAnDCA.GlobalOpt.subdiff (hDec A ρ) xs ⊆ TaoAnDCA.GlobalOpt.subdiff (gDec b ρ r) xs ↔ ∃ lam : ℝ, IsKKT A b r xs lam) := by sorry

end TaoAnDCA.TRS
Source
Pham Dinh & Le Thi, A d.c. optimization algorithm for solving the trust-region subproblem, SIAM J. Optim. 8 (1998), p. 491, §4.1, proof of Theorem 4.1, display (20) and the sentence after it
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