A Proximal Decomposition Method for Solving Convex Variational Inverse Problems

Abstract

A broad range of inverse problems can be abstracted into the problem of minimizing the sum of several convex functions in a Hilbert space. We propose a proximal decomposition algorithm for solving this problem with an arbitrary number of nonsmooth functions and establish its convergence. The algorithm fully decomposes the problem in that it involves each function individually via its own proximity operator. A significant improvement over the methods currently in use in the area of inverse problems is that it is not limited to two nonsmooth functions. Numerical applications to signal and image processing problems are demonstrated.

Cited by in corpus (26)

• NESTA: A Fast and Accurate First-order Method for Sparse Recovery
• Generalized Forward-Backward Splitting
• Convex optimization problem prototyping for image reconstruction in computed tomography with the Chambolle-Pock algorithm
• Convex Optimization for Big Data
• This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms - Theory and Practice
• Optimal Transport with Proximal Splitting
• Compressed sensing performance bounds under Poisson noise
• In-network Sparsity-regularized Rank Minimization: Algorithms and Applications
• A Non-Local Structure Tensor Based Approach for Multicomponent Image Recovery Problems
• Proximal extrapolated gradient methods for variational inequalities
• Linearly Involved Generalized Moreau Enhanced Models and Their Proximal Splitting Algorithm under Overall Convexity Condition
• Pocket Guide to Solve Inverse Problems with GlobalBioIm
• A Parallel Douglas Rachford Algorithm for Minimizing ROF-like Functionals on Images with Values in Symmetric Hadamard Manifolds
• PALMA, an improved algorithm for DOSY signal processing
• Relaxing Tight Frame Condition in Parallel Proximal Methods for Signal Restoration
• Wasserstein Patch Prior for Image Superresolution
• Joint Angular Refinement and Reconstruction for Single-Particle Cryo-EM
• Proximity Operators of Discrete Information Divergences
• Epigraphical Relaxation for Minimizing Layered Mixed Norms
• String-Averaging Incremental Subgradients for Constrained Convex Optimization with Applications to Reconstruction of Tomographic Images
• On-the-fly Approximation of Multivariate Total Variation Minimization
• Hierarchical Convex Optimization by the Hybrid Steepest Descent Method with Proximal Splitting Operators -- Enhancements of SVM and Lasso
• Score-matching neural networks for improved multi-band source separation
• JotlasNet: Joint Tensor Low-Rank and Attention-based Sparse Unrolling Network for Accelerating Dynamic MRI
• Sparsity Within and Across Overlapping Groups
• Uniqueness of DRS as the 2 Operator Resolvent-Splitting and Impossibility of 3 Operator Resolvent-Splitting