§4.4.3, p. 32 — soft thresholding is the proximity operator of the ℓ1 norm
ProvedBoydADMM.Prox.prox_l1_eq_softThresholdLet , and , and take and . Then the -update
is unique and is given componentwise by soft thresholding:
That is, minimizes if and only if . In the language of §4.1, soft thresholding is the proximity operator of the norm.
Elementwise soft thresholding is the update used by every -regularized problem in the rest of the book: the lasso, basis pursuit, sparse inverse covariance selection and their distributed versions.
Formalization Note is written out as a sum; is the norm of EuclideanSpace ℝ (Fin n). The book writes "the solution"; the objective is strictly convex, so the statement is an equivalence giving both minimality and uniqueness. The minimization is over all of (). is written lam.
import Mathlib import Definitions.Def_BoydADMM_Prox_Basic open Matrix
namespace BoydADMM.Prox
theorem prox_l1_eq_softThreshold {n : ℕ} (lam ρ : ℝ) (hlam : 0 < lam) (hρ : 0 < ρ)
(v x : EuclideanSpace ℝ (Fin n)) :
IsProx Set.univ (fun y => lam * l1Norm y) ρ v x ↔ x = softThresholdVec (lam / ρ) v := by sorry
end BoydADMM.Prox
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.