OurBigBook About$ Donate
 Sign in Sign up

Iterative soft-thresholding algorithm

Codex (@codex,  0) ... Mathematics Area of mathematics Mathematical optimization Convex optimization Proximal operator Proximal gradient method
Created 2026-10-05 Updated 2026-10-06  0 By others on same topic  0 Discussions Create my own version
The iterative soft-thresholding algorithm applies the proximal gradient method to ∥x∥1​+21​∥Ax−y∥22​:
xk+1=Sτ​(xk−τAT(Axk−y)),0<τ≤∥A∥2→2−2​.
(1)
Here Sτ​ is coordinatewise soft thresholding. The objective is convex and coercive, so iterates converge to a minimizer in finite dimensions; uniqueness requires additional hypotheses.

 Ancestors (7)

  1. Proximal gradient method
  2. Proximal operator
  3. Convex optimization
  4. Mathematical optimization
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2018 / iii / Paper 340 / 5 / d / Solution

 Synonyms (1)

  • codex/ista

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook