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)

• Projection methods: an annotated bibliography of books and reviews
• Optimization Methods for Synthetic Aperture Radar Imaging
• 4D-CT reconstruction with unified spatial-temporal patch-based regularization
• Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization
• A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
• Projective splitting with forward steps only requires continuity
• Block-simultaneous direction method of multipliers: a proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints
• Bregman three-operator splitting methods
• On Convex Finite-Dimensional Variational Methods in Imaging Sciences and Hamilton--Jacobi Equations
• Proximal algorithms in statistics and machine learning
• Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
• Infeasibility detection in the alternating direction method of multipliers for convex optimization
• A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
• A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
• First-order methods for convex optimization
• Variable metric forward–backward splitting with applications to monotone inclusions in duality
• General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
• Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
• Projection onto a polyhedron that exploits sparsity
• Compressive Imaging and Characterization of Sparse Light Deflection Maps
• Proximal Distance Algorithms: Theory and Examples
• Graphical-model based high dimensional generalized linear models
• Tensor theta norms and low rank recovery
• A convergent least-squares regularized blind deconvolution approach
• Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
• Iterative algorithm for the split equality problem in Hilbert spaces
• Fundamentals of cone regression
• An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
• On some steplength approaches for proximal algorithms
• Structured Variable Selection for Regularized Generalized Canonical Correlation Analysis
• Inexact first-order primal-dual algorithms
• Disparity and optical flow partitioning using extended Potts priors
• A splitting algorithm for dual monotone inclusions involving cocoercive operators
• Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
• A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
• Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
• A tensor-based dictionary learning approach to tomographic image reconstruction
• A splitting algorithm for coupled system of primal-dual monotone inclusions
• Parameter Selection and Preconditioning for a Graph Form Solver
• Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
• Sharp MSE bounds for proximal denoising
• CoShaRP: a convex program for single-shot tomographic shape sensing
• Sparse Principal Component Analysis via Variable Projection
• Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization
• Compressive optical deflectometric tomography: a constrained total-variation minimization approach
• Stability analysis of rough surfaces in adhesive normal contact
• An interpolating distance between optimal transport and Fisher-Rao metrics
• A spatial regularization approach for vector quantization
• Discrete Wavelet Transforms in the Large Time-Frequency Analysis Toolbox for MATLAB/GNU Octave
• Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression)
• Data-driven time-frequency analysis
• Convergence of stochastic proximal gradient algorithm
• Optimal subgradient algorithms for large-scale convex optimization in simple domains
• IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems
• Low rank matrix recovery from rank one measurements
• Conic optimization via operator splitting and homogeneous self-dual embedding
• Title not available (Why is that?)
• Title not available (Why is that?)
• Operator-valued kernel-based vector autoregressive models for network inference
• Learning with tensors: a framework based on convex optimization and spectral regularization
• Multiscale hierarchical decomposition methods for ill-posed problems
• The modified proximal point algorithm in CAT(0) spaces
• An introduction to continuous optimization for imaging
• Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning
• Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings
• Structured sparsity through convex optimization
• Solving the split equality problem without prior knowledge of operator norms
• Proximity for sums of composite functions
• A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
• Homogeneous penalizers and constraints in convex image restoration
• Convex regularization in statistical inverse learning problems
• A sequential updating scheme of the Lagrange multiplier for separable convex programming
• Localized density matrix minimization and linear-scaling algorithms
• Split common fixed point and null point problems for demicontractive operators in Hilbert spaces
• Distance majorization and its applications
• Nonlinear multilayered representation of graph-signals
• Signal Recovery by Proximal Forward-Backward Splitting
• Computing the generalized eigenvalues of weakly symmetric tensors
• Iterative methods for solving proximal split minimization problems
• Proximal point algorithms for finding common fixed points of a finite family of quasi-nonexpansive multi-valued mappings in real Hilbert spaces
• Title not available (Why is that?)
• On the zero point problem of monotone operators in Hadamard spaces
• Proximal operator of quotient functions with application to a feasibility problem in query optimization
• Data Assimilation in Reduced Modeling
• On convergence analysis of dual proximal-gradient methods with approximate gradient for a class of nonsmooth convex minimization problems
• Proximal Gradient Methods for Machine Learning and Imaging
• A proximal difference-of-convex algorithm with extrapolation
• Iterative algorithms for total variation-like reconstructions in seismic tomography
• Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA
• Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces
• On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds
• A cyclic block coordinate descent method with generalized gradient projections
• Kalman-Based Stochastic Gradient Method with Stop Condition and Insensitivity to Conditioning
• Low-Rank Inducing Norms with Optimality Interpretations
• Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials
• Bayesian computation: a summary of the current state, and samples backwards and forwards
• Accelerating \(\ell^1\)-\(\ell^2\) deblurring using wavelet expansions of operators
• A Single-Phase, Proximal Path-Following Framework
• Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions

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)