Accelerated alternating descent methods for Dykstra-like problems

DOI10.1007/s10851-017-0724-6zbMath1382.65167OpenAlexW2527243907MaRDI QIDQ1704007

Antonin Chambolle, Samuel Vaiter, Pauline Tan

Publication date: 8 March 2018

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10851-017-0724-6

zbMATH Keywords

total variation minimizationalternating minimizationsaccelerated methodsblock descent algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (6)

Enforcing geometrical priors in deep networks for semantic segmentation applied to radiotherapy planning ⋮ Crouzeix-Raviart approximation of the total variation on simplicial meshes ⋮ Alternating minimization methods for strongly convex optimization ⋮ Approximating the total variation with finite differences or finite elements ⋮ Inertial alternating generalized forward-backward splitting for image colorization ⋮ Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise

Uses Software

• UNLocBoX

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
• On the ergodic convergence rates of a first-order primal-dual algorithm
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
• An introduction to \(\Gamma\)-convergence
• Introductory lectures on convex optimization. A basic course.
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Accelerated and Inexact Forward-Backward Algorithms
• Proximal Splitting Methods in Signal Processing
• On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes
• Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA
• Weakly Differentiable Functions
• The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
• A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
• Image restoration: Total variation, wavelet frames, and beyond
• On the Convergence of Block Coordinate Descent Type Methods
• An introduction to continuous optimization for imaging
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Accelerated alternating descent methods for Dykstra-like problems