A proximal decomposition method for solving convex variational inverse problems
From MaRDI portal
Publication:3549282
DOI10.1088/0266-5611/24/6/065014zbMATH Open1154.49025arXiv0807.2617OpenAlexW3100489614MaRDI QIDQ3549282FDOQ3549282
Authors: Patrick L. Combettes, Jean-Christophe Pesquet 
Publication date: 22 December 2008
Published in: Inverse Problems (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0807.2617
Recommendations
- Inverse variational inequalities with projection-based solution methods
- Approximation of an inverse problem for variational inequalities
- Proximal algorithm for minimization problems in \(l_0\)-regularization for nonlinear inverse problems
- Convexity properties of inverse problems with variational constraints
- A proximal decomposition algorithm for variational inequality problems.
- A modified proximal-based decomposition method for variational inequalities
- A variable projection method for large-scale inverse problems with \(\ell^1\) regularization
- Iteratively solving linear inverse problems under general convex constraints
- A proximal iteratively regularized Gauss-Newton method for nonlinear inverse problems
- Solution paths of variational regularization methods for inverse problems
Decomposition methods (49M27) Inverse problems in optimal control (49N45) Applications of optimal control and differential games (49N90)
Cited In (48)
- Proximal algorithms for multicomponent image recovery problems
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Proximal-based recursive implementation for model-free data-driven fault diagnosis
- Activity Identification and Local Linear Convergence of Douglas–Rachford/ADMM under Partial Smoothness
- A Parallel Douglas–Rachford Algorithm for Minimizing ROF-like Functionals on Images with Values in Symmetric Hadamard Manifolds
- A variational formulation for frame-based inverse problems
- An image reconstruction model regularized by edge-preserving diffusion and smoothing for limited-angle computed tomography
- Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization
- Proximal splitting methods in signal processing
- Fast inexact decomposition algorithms for large-scale separable convex optimization
- Deconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priors
- Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- On the Douglas-Rachford algorithm
- Forward-partial inverse-forward splitting for solving monotone inclusions
- A Convex Approach for Image Restoration with Exact Poisson--Gaussian Likelihood
- Bayesian computation: a summary of the current state, and samples backwards and forwards
- Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
- Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
- A projection method for zeros of multi-valued monotone mappings
- On the convergence of broadcast incremental algorithms with applications
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- A splitting algorithm for coupled system of primal-dual monotone inclusions
- On the Range of the Douglas–Rachford Operator
- Box constrained total generalized variation model and primal-dual algorithm for Poisson noise removal
- Low Complexity Regularization of Linear Inverse Problems
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- Local convergence properties of Douglas-Rachford and alternating direction method of multipliers
- Pocket guide to solve inverse problems with GlobalBioIm
- Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing
- A spatial regularization approach for vector quantization
- A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation
- Total generalized variation denoising of speckled images using a primal-dual algorithm
- Affine nonexpansive operators, Attouch-Théra duality and the Douglas-Rachford algorithm
- Primal-dual algorithms for total variation based image restoration under Poisson noise
- On vector and matrix median computation
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Optimization of triangular networks with spatial constraints
- Convex variational formulation with smooth coupling for multicomponent signal decomposition and recovery
- Forward-reflected-backward and shadow-Douglas-Rachford with partial inverse for solving monotone inclusions
- Proximal extrapolated gradient methods for variational inequalities
- Alternating forward-backward splitting for linearly constrained optimization problems
- A Variable Metric Forward-Reflected-Douglas-Rachford Method for Solving Monotone Inclusions
- Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting
- Polynomial preconditioners for regularized linear inverse problems
- Algorithms for zeros of two accretive operators for solving convex minimization problems and its application to image restoration problems
- Signal Recovery by Proximal Forward-Backward Splitting
- Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition
This page was built for publication: A proximal decomposition method for solving convex variational inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549282)
