§2, pp. 4–5 — the semismooth Newton update based on (2.4) is the primal-dual active set step
ProvedPDASNewton.Local.newton_step_iff_stepactive-setcomplementarityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semismooth-newton
Let , and . For iterates and ,
holds if and only if follows by one step of the primal-dual active set algorithm: , on and on .
This is the identification that makes "the primal-dual active set method or, equivalently, the semismooth Newton method" of Theorem 3.1 one statement.
Formalization Note uses with , as the paper does. No matrix hypothesis is needed.
Preamble
import Mathlib import Definitions.Def_PDASNewton_Local_Setting
Formal statement
namespace PDASNewton.Local
/-- §2, pp. 4–5: the semismooth Newton update based on (2.4),
`G_F(x^k)(x^{k+1} - x^k) = -F(x^k)`, is equivalent to one step (ii)–(iii) of the primal-dual
active set strategy. -/
theorem newton_step_iff_step {n : ℕ} (A : Matrix (Fin n) (Fin n) ℝ) (f ψ : Fin n → ℝ)
(c : ℝ) (hc : 0 < c) (y lam y' lam' : Fin n → ℝ) :
GF A ψ c (y, lam) ((y', lam') - (y, lam)) = -Fmap A f ψ c (y, lam) ↔
IsStep A f ψ c y lam y' lam' := by sorry
end PDASNewton.Local
Source
Hintermüller, Ito, Kunisch, The primal-dual active set strategy as a semismooth Newton method, HAL hal-01660511v1, pp. 4–5, (2.4)–(2.6) and 'the semismooth Newton update based on (2.4) is equivalent to the primal-dual active set strategy'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.