Proximité et dualité dans un espace hilbertien II: Proximal Maps Are the Nonexpansive Subgradient Selections of Convex FunctionsResearch Paper
The proximal map of a convex function is the basic building block of proximal-point, forward–backward, Douglas–Rachford and ADMM methods, which are used throughout large-scale convex optimization, signal processing and operator splitting. All of these methods treat as a nonexpansive operator and use the fact that it is a gradient. The…