Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(P_k), §3.3, p. 487 — ∂g*(y) is the set of minimizers of g − ⟨·, y⟩

Proved
TaoAnDCA.TRS.subdiff_conj_eq_argmin

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

conjugateconvex-analysisdcap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1subdifferential

Let g∈Γ0(Rn)g\in\Gamma_0(\mathbb R^n)g∈Γ0​(Rn) and y∈Rny\in\mathbb R^ny∈Rn. Then the subdifferential of the conjugate g∗g^*g∗ at yyy is the set of minimizers of ggg tilted by yyy:

∂g∗(y)=argmin⁡{g(x)−⟨x,y⟩:x∈Rn},\partial g^*(y) = \operatorname{argmin}\{g(x) - \langle x, y\rangle : x\in\mathbb R^n\},∂g∗(y)=argmin{g(x)−⟨x,y⟩:x∈Rn},

where only points with g(x)<+∞g(x) < +\inftyg(x)<+∞ count as minimizers.

In the DCA, applied with y=yk∈∂h(xk)y = y^k\in\partial h(x^k)y=yk∈∂h(xk), this is the identification (P_k): the step xk+1∈∂g∗(yk)x^{k+1}\in\partial g^*(y^k)xk+1∈∂g∗(yk) amounts to solving the convex program obtained from (P) by replacing hhh with its affine minorization h(xk)+⟨x−xk,yk⟩h(x^k) + \langle x - x^k, y^k\rangleh(xk)+⟨x−xk,yk⟩.

Formalization Note. The paper writes the objective as g(x)−[h(xk)+⟨x−xk,yk⟩]g(x) - [h(x^k) + \langle x - x^k, y^k\rangle]g(x)−[h(xk)+⟨x−xk,yk⟩]; it differs from g(x)−⟨x,yk⟩g(x) - \langle x, y^k\rangleg(x)−⟨x,yk⟩ by the constant h(xk)−⟨xk,yk⟩h(x^k) - \langle x^k, y^k\rangleh(xk)−⟨xk,yk⟩, which does not change the set of minimizers, so the statement is given in this general form. The minimizers are required to lie in dom⁡g\operatorname{dom} gdomg, as the subdifferential is empty off dom⁡g∗\operatorname{dom} g^*domg∗ and a minimizer of a proper function has a finite value.

Preamble
import Mathlib
import Definitions.Def_TaoAnDCA_TRS_Setting

open Filter Topology
Formal statement
namespace TaoAnDCA.TRS

theorem subdiff_conj_eq_argmin {n : ℕ} (g : EuclideanSpace ℝ (Fin n) → EReal)
    (hg : ThreeOpSplitting.ConvexRates.IsProperClosedConvex g) (y : EuclideanSpace ℝ (Fin n)) :
    TaoAnDCA.GlobalOpt.subdiff (CondatPD.FinDim.conj g) y =
      {x | g x ≠ ⊤ ∧ ∀ z, g x - ((inner ℝ x y : ℝ) : EReal) ≤ g z - ((inner ℝ z y : ℝ) : EReal)} := 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. 487, §3.3, display (P_k)
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