Proximal Splitting Methods in Signal Processing

DOI10.1007/978-1-4419-9569-8_10zbMath1242.90160arXiv0912.3522OpenAlexW1946620893MaRDI QIDQ2897282

Patrick L. Combettes, Jean-Christophe Pesquet

Publication date: 10 July 2012

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

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

zbMATH Keywords

convex optimizationparallel computingsplittingframedenoisingsparsityproximal algorithmforward-backward algorithmDouglas-Rachford algorithmLandweber methoditerative 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)

Related Items (only showing first 100 items - show all)

A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates ⋮ Structured Variable Selection for Regularized Generalized Canonical Correlation Analysis ⋮ On a decomposition formula for the proximal operator of the sum of two convex functions ⋮ Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization ⋮ On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization ⋮ Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists ⋮ A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization ⋮ Some extensions of the operator splitting schemes based on Lagrangian and primal–dual: a unified proximal point analysis ⋮ A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems ⋮ An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization ⋮ Distributed Sparse Composite Quantile Regression in Ultrahigh Dimensions ⋮ Multiscale hierarchical decomposition methods for ill-posed problems ⋮ Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions ⋮ Circuit analysis using monotone+skew splitting ⋮ Strong convergence of the forward–backward splitting algorithms via linesearches in Hilbert spaces ⋮ Double inertial proximal gradient algorithms for convex optimization problems and applications ⋮ Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials ⋮ An accelerated tensorial double proximal gradient method for total variation regularization problem ⋮ Constrained composite optimization and augmented Lagrangian methods ⋮ Convex regularization in statistical inverse learning problems ⋮ Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization ⋮ Iterative algorithms for a non-linear inverse problem in atmospheric lidar ⋮ A Review of Data‐Driven Discovery for Dynamic Systems ⋮ A physically admissible Stokes vector reconstruction in linear polarimetric imaging ⋮ Convergence analysis of modified inertial forward–backward splitting scheme with applications ⋮ N-mode minimal tensor extrapolation methods ⋮ Structured model selection via ℓ1−ℓ2 optimization ⋮ Sparsity-Assisted Signal Smoothing ⋮ Inexact proximal DC Newton-type method for nonconvex composite functions ⋮ Stochastic projective splitting ⋮ On maximum a posteriori estimation with Plug \& Play priors and stochastic gradient descent ⋮ Sparse Bayesian learning approach for discrete signal reconstruction ⋮ A line search based proximal stochastic gradient algorithm with dynamical variance reduction ⋮ Data driven discovery of systems of ordinary differential equations using nonconvex multitask learning ⋮ A local MM subspace method for solving constrained variational problems in image recovery ⋮ Principled analyses and design of first-order methods with inexact proximal operators ⋮ Resolvent splitting for sums of monotone operators with minimal lifting ⋮ An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization ⋮ A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations ⋮ Efficient Bayesian Computation for Low-Photon Imaging Problems ⋮ First-order methods for convex optimization ⋮ On and Beyond Total Variation Regularization in Imaging: The Role of Space Variance ⋮ Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning ⋮ Stochastic variable metric proximal gradient with variance reduction for non-convex composite optimization ⋮ Convergence Results for Primal-Dual Algorithms in the Presence of Adjoint Mismatch ⋮ Optimal Transport Approximation of 2-Dimensional Measures ⋮ Unnamed Item ⋮ Two stochastic optimization algorithms for convex optimization with fixed point constraints ⋮ A Fast Algorithm for Learning Overcomplete Dictionary for Sparse Representation Based on Proximal Operators ⋮ Modified proximal point algorithms involving convex combination technique for solving minimization problems with convergence analysis ⋮ Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope ⋮ Extracting Structured Dynamical Systems Using Sparse Optimization With Very Few Samples ⋮ Higher-order total variation approaches and generalisations ⋮ Maximum Likelihood Estimation of Regularization Parameters in High-Dimensional Inverse Problems: An Empirical Bayesian Approach Part I: Methodology and Experiments ⋮ Geometric Matrix Midranges ⋮ Discussion on the Paper by Byrne and Girolami ⋮ IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems ⋮ Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT) ⋮ An introduction to continuous optimization for imaging ⋮ Proximal Distance Algorithms: Theory and Examples ⋮ Bayesian computation: a summary of the current state, and samples backwards and forwards ⋮ A distributed Douglas-Rachford splitting method for multi-block convex minimization problems ⋮ Structured sparsity through convex optimization ⋮ Data-Driven Nonsmooth Optimization ⋮ Dynamical Systems Coupled with Monotone Set-Valued Operators: Formalisms, Applications, Well-Posedness, and Stability ⋮ A Single-Phase, Proximal Path-Following Framework ⋮ Deep unfolding of a proximal interior point method for image restoration ⋮ Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition ⋮ On Algorithms for Difference of Monotone Operators ⋮ On Algorithms for Difference of Monotone Operators ⋮ An image reconstruction model regularized by edge-preserving diffusion and smoothing for limited-angle computed tomography ⋮ Plug-and-Play Unplugged: Optimization-Free Reconstruction Using Consensus Equilibrium ⋮ Enhancing Compressed Sensing 4D Photoacoustic Tomography by Simultaneous Motion Estimation ⋮ Solving inverse problems using data-driven models ⋮ Convergence Rates for Projective Splitting ⋮ On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence ⋮ Adaptive FISTA for Nonconvex Optimization ⋮ Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization ⋮ A Convex Approach to Superresolution and Regularization of Lines in Images ⋮ A Proximal Operator for Multispectral Phase Retrieval Problems ⋮ Variable metric forward–backward splitting with applications to monotone inclusions in duality ⋮ Unnamed Item ⋮ Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping ⋮ Kalman-Based Stochastic Gradient Method with Stop Condition and Insensitivity to Conditioning ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A proximal point method for the sum of maximal monotone operators ⋮ Learning Maximally Monotone Operators for Image Recovery ⋮ Maximum-a-Posteriori Estimation with Bayesian Confidence Regions ⋮ ADMM in Krylov Subspace and Its Application to Total Variation Restoration of Spatially Variant Blur ⋮ A Selective Linearization Method For Multiblock Convex Optimization ⋮ Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization ⋮ Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems ⋮ Signal Decomposition Using Masked Proximal Operators ⋮ Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing ⋮ Data Assimilation in Reduced Modeling ⋮ Implicit regularization with strongly convex bias: Stability and acceleration ⋮ Discrete Wavelet Transforms in the Large Time-Frequency Analysis Toolbox for MATLAB/GNU Octave ⋮ Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization ⋮ On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions

Uses Software

• UNLocBoX

Cites Work

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

This page was built for publication: Proximal Splitting Methods in Signal Processing