Proximal splitting methods in signal processing

DOI10.1007/978-1-4419-9569-8_10zbMATH Open1242.90160arXiv0912.3522OpenAlexW1946620893MaRDI QIDQ2897282FDOQ2897282

Authors: Patrick L. Combettes, Jean-Christophe Pesquet 

Publication date: 10 July 2012

Published in: Springer Optimization and Its Applications (Search for Journal in Brave)

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 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.

Full work available at URL: https://arxiv.org/abs/0912.3522

Recommendations

• Signal Recovery by Proximal Forward-Backward Splitting
• Proximal activation of smooth functions in splitting algorithms for convex image recovery
• Proximity for sums of composite functions
• Proximal algorithms for multicomponent image recovery problems
• Proximal Thresholding Algorithm for Minimization over Orthonormal Bases

zbMATH Keywords

denoisingforward-backward algorithmconvex optimizationsparsityparallel computingframeproximal algorithmDouglas-Rachford algorithmLandweber methodsplittingiterative thresholdingPeaceman-Rachford algorithmalternating-direction method of multipliersbackward-backward algorithmrestoration and reconstruction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Applications of mathematical programming (90C90) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites Work

• New Proximal Point Algorithms for Convex Minimization
• Convergence d'un schéma de minimisation alternée
• A forward–backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space
• Generalized Image Restoration by the Method of Alternating Orthogonal Projections
• Title not available (Why is that?)
• Simultaneously inpainting in image and transformed domains
• Signal synthesis in the presence of an inconsistent set of constraints
• Extensions of a result on the synthesis of signals in the presence of inconsistent constraints
• Convex variational formulation with smooth coupling for multicomponent signal decomposition and recovery
• A Fast Multilevel Algorithm for Wavelet-Regularized Image Restoration
• Wavelet thresholding for some classes of non–Gaussian noise
• Parallel Proximal Algorithm for Image Restoration Using Hybrid Regularization
• An iterative method for the extrapolation of band-limited functions
• Asymptotic Convergence Analysis of the Forward-Backward Splitting Algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• The application of an oblique-projected Landweber method to a model of supervised learning
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Nonlinear total variation based noise removal algorithms
• Title not available (Why is that?)
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Parallel alternating direction multiplier decomposition of convex programs
• Fundamentals of Computerized Tomography
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Title not available (Why is that?)
• On Projection Algorithms for Solving Convex Feasibility Problems
• Title not available (Why is that?)
• Convex analysis and monotone operator theory in Hilbert spaces
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Smooth minimization of non-smooth functions
• Title not available (Why is that?)
• Just relax: convex programming methods for identifying sparse signals in noise
• Title not available (Why is that?)
• Regularization of Wavelet Approximations
• Convex Analysis
• The Split Bregman Method for L1-Regularized Problems
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• Fast Image Recovery Using Variable Splitting and Constrained Optimization
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Hard-constrained inconsistent signal feasibility problems
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Title not available (Why is that?)
• Signal Recovery by Proximal Forward-Backward Splitting
• A proximal-based deomposition method for compositions method for convex minimization problems
• Image denoising and decomposition with total variation minimization and oscillatory functions
• An algorithm for total variation minimization and applications
• Image decomposition into a bounded variation component and an oscillating component
• Dual norms and image decomposition models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• An EM algorithm for wavelet-based image restoration
• Bregmanized nonlocal regularization for deconvolution and sparse reconstruction
• Title not available (Why is that?)
• Monotone Operators and the Proximal Point Algorithm
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Proximité et dualité dans un espace hilbertien
• Title not available (Why is that?)
• Computer Vision - ECCV 2004
• Title not available (Why is that?)
• Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
• Convexity, monotonicity, and gradient processes in Hilbert space
• Produits infinis de resolvantes
• Title not available (Why is that?)
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Title not available (Why is that?)
• Iteration methods for convexly constrained ill-posed problems in hilbert space
• Title not available (Why is that?)
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Iterative construction of the resolvent of a sum of maximal monotone operators
• A framelet-based image inpainting algorithm
• Methodes itératives pour les équations et inéquations aux dérivées partielles non linéaires de type monotone. (Iteration methods for nonlinear equations and inequations with partial derivatives of monotone type)
• A Dual Approach to Linear Inverse Problems with Convex Constraints
• A Fast Total Variation Minimization Method for Image Restoration
• An Algorithm for Restricted Least Squares Regression
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convergence Rates in Forward--Backward Splitting
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonnegative least-squares image deblurring: improved gradient projection approaches
• Title not available (Why is that?)
• Multiplicative noise removal using L1 fidelity on frame coefficients
• Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
• Removing multiplicative noise by Douglas-Rachford splitting methods
• Convergence analysis of tight framelet approach for missing data recovery
• Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
• A block-iterative surrogate constraint splitting method for quadratic signal recovery
• Iteratively solving linear inverse problems under general convex constraints
• A proximal decomposition method for solving convex variational inverse problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Quadratic optimization of fixed points of nonexpansive mappings in hubert space
• Partial inverse of a monotone operator
• The asymptotic behavior of the composition of two resolvents
• Decomposition through formalization in a product space
• Combined \(\ell_{2}\) data and gradient fitting in conjunction with \(\ell_{1}\) regularization
• Dykstra's alternating projection algorithm for two sets
• Title not available (Why is that?)
• General Projective Splitting Methods for Sums of Maximal Monotone Operators
• Total Variation Projection With First Order Schemes
• Lectures on topics in finite element solution of elliptic problems. Notes by G. Vijayasundaram
• Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
• Domain decomposition methods for linear inverse problems with sparsity constraints
• Dualization of signal recovery problems
• Linear convergence of iterative soft-thresholding
• Nested Iterative Algorithms for Convex Constrained Image Recovery Problems
• Augmented Lagrangian and proximal alternating direction methods of multipliers in Hilbert spaces. Applications to games, PDE's and control
• A Proximal Iteration for Deconvolving Poisson Noisy Images Using Sparse Representations
• Efficient schemes for total variation minimization under constraints in image processing
• Proximity Maps for Convex Sets
• Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
• Inpainting by Flexible Haar-Wavelet Shrinkage
• On some Bayesian choices of regularization parameter in image restoration
• A variational formulation for frame-based inverse problems
• Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

• A Convex Approach to Superresolution and Regularization of Lines in Images
• An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems
• Local R-linear convergence of ADMM-based algorithm for \(\ell_1\)-norm minimization with linear and box constraints
• Vertex-frequency analysis on graphs
• Efficient Bayesian Computation for Low-Photon Imaging Problems
• Proximal-type algorithms for split minimization problem in P-uniformly convex metric spaces
• Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems
• Convergence Results for Primal-Dual Algorithms in the Presence of Adjoint Mismatch
• Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
• A self-adaptive algorithm for split null point problems and fixed point problems for demicontractive multivalued mappings
• Nonsmoothness in machine learning: specific structure, proximal identification, and applications
• An adapted linear discriminant analysis with variable selection for the classification in high-dimension, and an application to medical data
• On Algorithms for Difference of Monotone Operators
• An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography
• A generalized robust minimization framework for low-rank matrix recovery
• Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization
• A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
• Data-driven nonsmooth optimization
• Multiresolution parameter choice method for total variation regularized tomography
• From error bounds to the complexity of first-order descent methods for convex functions
• Generalized Kalman smoothing: modeling and algorithms
• Total variation superiorized conjugate gradient method for image reconstruction
• Discrete total variation: new definition and minimization
• Inertial variable metric techniques for the inexact forward-backward algorithm
• Split null point problems and fixed point problems for demicontractive multivalued mappings
• Low complexity regularization of linear inverse problems
• Convergence rate analysis of the forward-Douglas-Rachford splitting scheme
• Another look at the fast iterative shrinkage/thresholding algorithm (FISTA)
• Sensitivity analysis for mirror-stratifiable convex functions
• A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
• A hybrid proximal point algorithm for finding minimizers and fixed points in CAT(0) spaces
• A convergent relaxation of the Douglas-Rachford algorithm
• Modified proximal point algorithms for solving constrained minimization and fixed point problems in complete CAT(0) spaces
• Proximal activation of smooth functions in splitting algorithms for convex image recovery
• Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
• Total variation with overlapping group sparsity for deblurring images under Cauchy noise
• An adaptive alternating direction method of multipliers
• On algorithms for difference of monotone operators
• Extragradient method in optimization: convergence and complexity
• An adaptive primal-dual framework for nonsmooth convex minimization
• A block coordinate variable metric forward-backward algorithm
• Newton-like dynamics and forward-backward methods for structured monotone inclusions in Hilbert spaces
• Computing proximal points of convex functions with inexact subgradients
• The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints
• Perspective functions: proximal calculus and applications in high-dimensional statistics
• An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso
• Backward-forward algorithms for structured monotone inclusions in Hilbert spaces
• Generalized row-action methods for tomographic imaging
• Tight global linear convergence rate bounds for Douglas-Rachford splitting
• A survey on operator splitting and decomposition of convex programs
• Sparse time-frequency decomposition based on dictionary adaptation
• On quasi-Newton forward-backward splitting: proximal calculus and convergence
• Sparse Bayesian learning approach for discrete signal reconstruction
• On the linear convergence of forward-backward splitting method. I: Convergence analysis
• A fast dual proximal gradient algorithm for convex minimization and applications
• An alternating direction method for total variation denoising
• Piecewise-polynomial signal segmentation using convex optimization.
• Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
• A proximal splitting method for separable convex programming and its application to compressive sensing
• Variable metric inexact line-search-based methods for nonsmooth optimization
• Parseval proximal neural networks
• New Douglas-Rachford algorithmic structures and their convergence analyses
• Convex variational formulation with smooth coupling for multicomponent signal decomposition and recovery
• Combining line search and trust-region methods forℓ1-minimization
• Proximal extrapolated gradient methods for variational inequalities
• NETT: solving inverse problems with deep neural networks
• Convergence analysis of an inexact three-operator splitting algorithm
• Relax-and-split method for nonconvex inverse problems
• Efficient evaluation of scaled proximal operators
• Deep unfolding of a proximal interior point method for image restoration
• Solving inverse problems using data-driven models
• Backward-backward splitting in Hadamard spaces
• A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
• Monotone operator theory in convex optimization
• Title not available (Why is that?)
• A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates
• Decomposition methods for a spatial model for long-term energy pricing problem
• Adaptive smoothing algorithms for nonsmooth composite convex minimization
• Optimal transport in full-waveform inversion: analysis and practice of the multidimensional Kantorovich-Rubinstein norm
• Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing
• Peridynamics enabled learning partial differential equations
• Generalized Sinkhorn iterations for regularizing inverse problems using optimal mass transport
• Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
• RNLp: mixing nonlocal and TV-Lp methods to remove impulse noise from images
• On the convergence of the forward-backward splitting method with linesearches
• An image reconstruction model regularized by edge-preserving diffusion and smoothing for limited-angle computed tomography
• Quantization and compressive sensing
• Designing Gabor windows using convex optimization
• The distance between convex sets with Minkowski sum structure: application to collision detection
• Higher-order total variation approaches and generalisations
• Adaptive FISTA for Nonconvex Optimization
• Variable metric techniques for forward-backward methods in imaging
• A parallel operator splitting algorithm for solving constrained total-variation retinex
• SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
• Single-forward-step projective splitting: exploiting cocoercivity
• Fast Mumford-Shah two-phase image segmentation using proximal splitting scheme
• The numerical reckoning of modified proximal point methods for minimization problems in non-positive curvature metric spaces
• On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting
• Title not available (Why is that?)
• Contrast invariant SNR and isotonic regressions

Uses Software

• UNLocBoX

This page was built for publication: Proximal splitting methods in signal processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897282)