Proximal gradient method: Difference between revisions

Revision as of 04:25, 8 September 2014

Revision as of 17:43, 12 October 2014

Line 1:

{{more footnotes|date=November 2013}}

[[Convex'''Proximal optimization]]gradient methods''' isare a subgeneralized fieldform of [[optimization]]projection whichused canto producesolve reliablenon-differentiable solutions[[convex and can be solvedoptimization]] exactlyproblems. Many [[signal processing]]interesting problems can be formulated as convex optimization problems of form

:<math> \begin{align}