A proximal decomposition method for solving convex variational inverse problems
From MaRDI portal
Publication:3549282
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.
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
Cited in
(49)- A Variable Metric Forward-Reflected-Douglas-Rachford Method for Solving Monotone Inclusions
- Primal-dual algorithms for total variation based image restoration under Poisson noise
- Optimization of triangular networks with spatial constraints
- Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization
- Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
- A splitting algorithm for coupled system of primal-dual monotone inclusions
- A spatial regularization approach for vector quantization
- A variational formulation for frame-based inverse problems
- A projection method for zeros of multi-valued monotone mappings
- On the convergence of broadcast incremental algorithms with applications
- A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation
- Convex variational formulation with smooth coupling for multicomponent signal decomposition and recovery
- Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- Total generalized variation denoising of speckled images using a primal-dual algorithm
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- On vector and matrix median computation
- Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting
- Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
- Algorithms for zeros of two accretive operators for solving convex minimization problems and its application to image restoration problems
- A convex approach for image restoration with exact Poisson-Gaussian likelihood
- A parallel Douglas-Rachford algorithm for minimizing ROF-like functionals on images with values in symmetric Hadamard manifolds
- Proximal splitting methods in signal processing
- Activity identification and local linear convergence of Douglas-Rachford/ADMM under partial smoothness
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Local convergence properties of Douglas-Rachford and alternating direction method of multipliers
- Fast inexact decomposition algorithms for large-scale separable convex optimization
- On the Douglas-Rachford algorithm
- On a decomposition formula for the proximal operator of the sum of two convex functions
- Polynomial preconditioners for regularized linear inverse problems
- Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition
- Proximal extrapolated gradient methods for variational inequalities
- Box constrained total generalized variation model and primal-dual algorithm for Poisson noise removal
- Deconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priors
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Alternating forward-backward splitting for linearly constrained optimization problems
- Forward-partial inverse-forward splitting for solving monotone inclusions
- On the range of the Douglas-Rachford operator
- Proximal algorithms for multicomponent image recovery problems
- Signal Recovery by Proximal Forward-Backward Splitting
- Proximal-based recursive implementation for model-free data-driven fault diagnosis
- Low complexity regularization of linear inverse problems
- Bayesian computation: a summary of the current state, and samples backwards and forwards
- An image reconstruction model regularized by edge-preserving diffusion and smoothing for limited-angle computed tomography
- Pocket guide to solve inverse problems with GlobalBioim
- Forward-reflected-backward and shadow-Douglas-Rachford with partial inverse for solving monotone inclusions
- Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing
- Affine nonexpansive operators, Attouch-Théra duality and the Douglas-Rachford algorithm
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)
