Accelerated alternating descent methods for Dykstra-like problems
From MaRDI portal
Publication:1704007
Recommendations
- Fast alternating direction optimization methods
- An acceleration scheme for Dykstra's algorithm
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- Fast alternating linearization methods for minimizing the sum of two convex functions
- On the convergence of block coordinate descent type methods
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- Accelerated and inexact forward-backward algorithms
- An introduction to -convergence
- An introduction to continuous optimization for imaging
- scientific article; zbMATH DE number 410743 (Why is no real title available?)
- scientific article; zbMATH DE number 3929712 (Why is no real title available?)
- scientific article; zbMATH DE number 1865939 (Why is no real title available?)
- Image restoration: total variation, wavelet frames, and beyond
- Introductory lectures on convex optimization. A basic course.
- On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes
- On the convergence of block coordinate descent type methods
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- On the ergodic convergence rates of a first-order primal-dual algorithm
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- Proximal splitting methods in signal processing
- Stability of over-relaxations for the forward-backward algorithm, application to FISTA
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- Weakly Differentiable Functions
Cited in
(15)- Distributed minimal residual (DMR) method for acceleration of iterative algorithms
- An alternating direction method for finding Dantzig selectors
- Inertial alternating generalized forward-backward splitting for image colorization
- 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
- Enforcing geometrical priors in deep networks for semantic segmentation applied to radiotherapy planning
- scientific article; zbMATH DE number 3961340 (Why is no real title available?)
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- Accelerated Schemes for the $L_1/L_2$ Minimization
- Fast alternating direction optimization methods
- Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise
- Integer optimal control with fractional perimeter regularization
- Discretization of total variation in optimization with integrality constraints
- McCormick envelopes in mixed-integer PDE-constrained optimization
This page was built for publication: Accelerated alternating descent methods for Dykstra-like problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704007)
