Proximal Splitting Methods in Signal Processing

DOI10.1007/978-1-4419-9569-8_10zbMath1242.90160arXiv0912.3522MaRDI 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 optimization; parallel computing; splitting; frame; denoising; sparsity; proximal algorithm; forward-backward algorithm; Douglas-Rachford algorithm; Landweber method; iterative thresholding; Peaceman-Rachford algorithm; alternating-direction method of multipliers; backward-backward algorithm; restoration and reconstruction

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

90C90: Applications of mathematical programming

94A08: Image processing (compression, reconstruction, etc.) in information and communication theory

Related Items

4D-CT reconstruction with unified spatial-temporal patch-based regularization, 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, Conic optimization via operator splitting and homogeneous self-dual embedding, 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, Proximal point algorithms for nonsmooth convex optimization with fixed point constraints, Sharp MSE bounds for proximal denoising, Low rank matrix recovery from rank one measurements, Nonlinear multilayered representation of graph-signals, Distance majorization and its applications, Compressive optical deflectometric tomography: a constrained total-variation minimization approach, Operator-valued kernel-based vector autoregressive models for network inference, On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm, The modified proximal point algorithm in CAT(0) spaces, Computing the generalized eigenvalues of weakly symmetric tensors, Decomposition methods for a spatial model for long-term energy pricing problem, Adaptive smoothing algorithms for nonsmooth composite convex minimization, Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization, Proximity for sums of composite functions, Randomization of data acquisition and $\ell_{1}$-optimization (recognition with compression), 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, A block coordinate variable metric forward-backward algorithm, A tensor-based dictionary learning approach to tomographic image reconstruction, Generalized row-action methods for tomographic imaging, A primal dual active set with continuation algorithm for the $\ell^0$-regularized optimization problem, Vertex-frequency analysis on graphs, Proximal point algorithms for finding common fixed points of a finite family of quasi-nonexpansive multi-valued mappings in real Hilbert spaces, Stability analysis of rough surfaces in adhesive normal contact, A convergent least-squares regularized blind deconvolution approach, Accelerating $\ell^1$-$\ell^2$ deblurring using wavelet expansions of operators, Monotone operator theory in convex optimization, Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription, Alternating direction method of multipliers for separable convex optimization of real functions in complex variables, A fast dual proximal gradient algorithm for convex minimization and applications, A regularized semi-smooth Newton method with projection steps for composite convex programs, Adaptive restart of the optimized gradient method for convex optimization, Exact worst-case convergence rates of the proximal gradient method for composite convex minimization, Convergence of functions and their Moreau envelopes on Hadamard spaces, From error bounds to the complexity of first-order descent methods for convex functions, Generalized Kalman smoothing: modeling and algorithms, A conjugate subgradient algorithm with adaptive preconditioning for the least absolute shrinkage and selection operator minimization, Tight global linear convergence rate bounds for Douglas-Rachford splitting, Optimal subgradient algorithms for large-scale convex optimization in simple domains, On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds, A unified formulation for generalized oilfield development optimization, Iterative regularization via dual diagonal descent, The Shannon total variation, Accelerated alternating descent methods for Dykstra-like problems, Optimal selection of the regularization function in a weighted total variation model. II: Algorithm, its analysis and numerical tests, An interpolating distance between optimal transport and Fisher-Rao metrics, Extragradient method in optimization: convergence and complexity, A generalized robust minimization framework for low-rank matrix recovery, Sensitivity analysis of the proximal-based parallel decomposition methods, Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization, A cyclic block coordinate descent method with generalized gradient projections, On the zero point problem of monotone operators in Hadamard spaces, A proximal difference-of-convex algorithm with extrapolation, Iterative methods for solving proximal split minimization problems, Split null point problems and fixed point problems for demicontractive multivalued mappings, Iterative algorithms for total variation-like reconstructions in seismic tomography, Proximal algorithms in statistics and machine learning, A block coordinate variable metric linesearch based proximal gradient method, Modified Fejér sequences and applications, A spatial regularization approach for vector quantization, Fast projections onto mixed-norm balls with applications, An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography, A splitting algorithm for dual monotone inclusions involving cocoercive operators, A convex optimization model and algorithm for retinex, Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions, Newton-like dynamics and forward-backward methods for structured monotone inclusions in Hilbert spaces, A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation, Homogeneous penalizers and constraints in convex image restoration, An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices, Fully smoothed $\ell_1$-$TV$ models: bounds for the minimizers and parameter choice, Learning with tensors: a framework based on convex optimization and spectral regularization, Data-driven time-frequency analysis, Backward-backward splitting in Hadamard spaces, A splitting algorithm for coupled system of primal-dual monotone inclusions, Proximal operator of quotient functions with application to a feasibility problem in query optimization, Combined first and second order variational approaches for image processing, On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions, Proximal point algorithms for a hybrid pair of nonexpansive single-valued and multi-valued mappings in geodesic metric spaces, Forward-backward quasi-Newton methods for nonsmooth optimization problems, Localized density matrix minimization and linear-scaling algorithms, Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators, Depression disorder classification of fMRI data using sparse low-rank functional brain network and graph-based features, Backward-forward algorithms for structured monotone inclusions in Hilbert spaces, Perspective functions: proximal calculus and applications in high-dimensional statistics, Computing proximal points of convex functions with inexact subgradients, RNLp: mixing nonlocal and TV-Lp methods to remove impulse noise from images, Nonconvex mixed TV/Cahn-Hilliard functional for super-resolution/segmentation of 3D trabecular bone images, A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression, General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems, Unnamed Item, Sensitivity Analysis for Mirror-Stratifiable Convex Functions, Low-Rank Inducing Norms with Optimality Interpretations, Optimization Methods for Synthetic Aperture Radar Imaging, A hierarchical Bayesian perspective on majorization-minimization for non-convex sparse regression: application to M/EEG source imaging, A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization, Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA), Disparity and optical flow partitioning using extended Potts priors, Efficient regularization with wavelet sparsity constraints in photoacoustic tomography, Split common fixed point and null point problems for demicontractive operators in Hilbert spaces, Parameter Selection and Preconditioning for a Graph Form Solver, String-averaging incremental stochastic subgradient algorithms, Total variation superiorized conjugate gradient method for image reconstruction, Proximal extrapolated gradient methods for variational inequalities, Variational regularization of the weighted conical Radon transform, Joint Sparse Recovery Based on Variances, Learning partial differential equations via data discovery and sparse optimization, Inertial Variable Metric Techniques for the Inexact Forward--Backward Algorithm, Efficient Bayesian Computation by Proximal Markov Chain Monte Carlo: When Langevin Meets Moreau, Analysis of Optimization Algorithms via Integral Quadratic Constraints: Nonstrongly Convex Problems, Generalized Sinkhorn Iterations for Regularizing Inverse Problems Using Optimal Mass Transport, A Forward-Adjoint Operator Pair Based on the Elastic Wave Equation for Use in Transcranial Photoacoustic Computed Tomography, Modular proximal optimization for multidimensional total-variation regularization, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, A proximal point method for the sum of maximal monotone operators, 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, Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing, Data Assimilation in Reduced Modeling, 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, Structured Variable Selection for Regularized Generalized Canonical Correlation Analysis, Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization, Iterative algorithms for a non-linear inverse problem in atmospheric lidar, Sparsity-Assisted Signal Smoothing, 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, Discussion on the Paper by Byrne and Girolami, Proximal Distance Algorithms: Theory and Examples, Variable metric forward–backward splitting with applications to monotone inclusions in duality, Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping, Kalman-Based Stochastic Gradient Method with Stop Condition and Insensitivity to Conditioning, 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, 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, A nonsmooth regularization approach based on shearlets for Poisson noise removal in ROI tomography, An unexpected connection between Bayes $A$-optimal designs and the group Lasso, On proximal gradient method for the convex problems regularized with the group reproducing kernel norm, On convergence analysis of dual proximal-gradient methods with approximate gradient for a class of nonsmooth convex minimization problems, Proximal Markov chain Monte Carlo algorithms, New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses, Optimal Kullback–Leibler approximation of Markov chains via nuclear norm regularisation, Low Complexity Regularization of Linear Inverse Problems, Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization, A variant of forward-backward splitting method for the sum of two monotone operators with a new search strategy, Solving the split equality problem without prior knowledge of operator norms, Projection onto a Polyhedron that Exploits Sparsity, A Variable Metric Forward-Backward Method with Extrapolation, A sequential updating scheme of the Lagrange multiplier for separable convex programming, On the convergence of the forward–backward splitting method with linesearches, Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings, Distributed solutions for loosely coupled feasibility problems using proximal splitting methods, An alternating direction method for total variation denoising, Convergence Rate Analysis of the Forward-Douglas-Rachford Splitting Scheme, Sparse time-frequency decomposition based on dictionary adaptation, A nonconvex approach to low-rank matrix completion using convex optimization, A survey on operator splitting and decomposition of convex programs, Discrete Total Variation: New Definition and Minimization, Nonsmooth convex optimization for structured illumination microscopy image reconstruction, Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares, Multiresolution Parameter Choice Method for Total Variation Regularized Tomography, A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging, Compressive Imaging and Characterization of Sparse Light Deflection Maps, Projection methods: an annotated bibliography of books and reviews, On Convex Finite-Dimensional Variational Methods in Imaging Sciences and Hamilton--Jacobi Equations, A Convex Approach for Image Restoration with Exact Poisson--Gaussian Likelihood, Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA, Quantization and Compressive Sensing

Uses Software

UNLocBoX

Cites Work