Abstract
The proximity operator of a convex function is a natural extension of the notion of a projection operator onto a convex set. This tool, which plays a central role in the analysis and the numerical solution of convex optimization problems, has recently been introduced in the arena of inverse problems and, especially, in signal processing, where it has become increasingly important. In this paper, we review the basic properties of proximity operators which are relevant to signal processing and present optimization methods based on these operators. These proximal splitting methods are shown to capture and extend several well-known algorithms in a unifying framework. Applications of proximal methods in signal recovery and synthesis are discussed.
Author supplied keywords
- Alternating-direction method of multipliers
- Backward–backward algorithm
- Convex optimization
- Denoising
- Douglas–Rachford algorithm
- Forward–backward algorithm
- Frame
- Iterative thresholding
- Landweber method
- Parallel computing
- Peaceman–Rachford algorithm
- Proximal algorithm
- Restoration and reconstruction
- Sparsity
- Splitting
Cite
CITATION STYLE
Combettes, P. L., & Pesquet, J. C. (2011). Proximal splitting methods in signal processing. In Springer Optimization and Its Applications (Vol. 49, pp. 185–212). Springer International Publishing. https://doi.org/10.1007/978-1-4419-9569-8_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.