A proximal decomposition method for solving convex variational inverse problems

From MaRDI portal
Publication:3549282

DOI10.1088/0266-5611/24/6/065014zbMath1154.49025arXiv0807.2617OpenAlexW3100489614MaRDI QIDQ3549282

Patrick L. Combettes, Jean-Christophe Pesquet

Publication date: 22 December 2008

Published in: Inverse Problems (Search for Journal in Brave)

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




Related Items (39)

On the Douglas-Rachford algorithmParallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappingsProximal Splitting Methods in Signal ProcessingMinimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive MappingsPrimal-dual algorithms for total variation based image restoration under Poisson noiseA Convex Approach for Image Restoration with Exact Poisson--Gaussian LikelihoodConvergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappingsOn the Range of the Douglas–Rachford OperatorA Parallel Douglas–Rachford Algorithm for Minimizing ROF-like Functionals on Images with Values in Symmetric Hadamard ManifoldsLocal convergence properties of Douglas-Rachford and alternating direction method of multipliersOptimization of triangular networks with spatial constraintsDistributed solutions for loosely coupled feasibility problems using proximal splitting methodsAffine nonexpansive operators, Attouch-Théra duality and the Douglas-Rachford algorithmNonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimizationProximal algorithms for multicomponent image recovery problemsA spatial regularization approach for vector quantizationAlternating forward-backward splitting for linearly constrained optimization problemsUniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splittingAlgorithms for zeros of two accretive operators for solving convex minimization problems and its application to image restoration problemsBox constrained total generalized variation model and primal-dual algorithm for Poisson noise removalOn vector and matrix median computationWeighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensingActivity Identification and Local Linear Convergence of Douglas–Rachford/ADMM under Partial SmoothnessForward-partial inverse-forward splitting for solving monotone inclusionsProximal extrapolated gradient methods for variational inequalitiesA parallel proximal splitting method for disparity estimation from multicomponent images under illumination variationLearning with tensors: a framework based on convex optimization and spectral regularizationDeconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priorsPocket guide to solve inverse problems with GlobalBioImFast inexact decomposition algorithms for large-scale separable convex optimizationLow Complexity Regularization of Linear Inverse ProblemsBayesian computation: a summary of the current state, and samples backwards and forwardsTotal generalized variation denoising of speckled images using a primal-dual algorithmLinearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity conditionAn image reconstruction model regularized by edge-preserving diffusion and smoothing for limited-angle computed tomographyIncremental subgradient method for nonsmooth convex optimization with fixed point constraintsStrong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorizationForward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusionsA splitting algorithm for coupled system of primal-dual monotone inclusions




This page was built for publication: A proximal decomposition method for solving convex variational inverse problems