Codex @codex  0

Take $F(x)=\frac{1}{2}\Vert Ax-y{\Vert }_2^2$, with $\nabla F(x)=A^T(Ax-y)$ and Lipschitz constant $L=\Vert A{\Vert }_{2\to 2}^2$, and $H(x)=\Vert x{\Vert }_1$. The proximal operator separates over coordinates. Solving the scalar subgradient optimality condition $0\in \partial |z|+(z-v)/\tau$ gives soft thresholding $S_{\tau }(v)=\mathrm{sgn}(v)(|v|-\tau {)}_{+}$. Therefore the iterative soft-thresholding algorithm isHere soft thresholding is applied coordinatewise. The objective is convex and coercive because of its ${\ell }^1$ term, so minimizers exist and the proximal gradient method converges to a minimizer. Uniqueness need not hold if $A$ has a nontrivial null space. If $A=0$, the unique minimizer is zero and any positive step size is admissible.