Accelerated Alternating Descent Methods for Dykstra-Like Problems
- 17 March 2017
- journal article
- research article
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 59 (3) , 481-497
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- On the Convergence of the Iterates of the “Fast Iterative Shrinkage/Thresholding Algorithm”Journal of Optimization Theory and Applications, 2015
- On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition SchemesSIAM Journal on Optimization, 2015
- On the Convergence of Block Coordinate Descent Type MethodsSIAM Journal on Optimization, 2013
- Accelerated and Inexact Forward-Backward AlgorithmsSIAM Journal on Optimization, 2013
- Image restoration: Total variation, wavelet frames, and beyondJournal of the American Mathematical Society, 2012
- Proximal Splitting Methods in Signal Processing2011
- A First-Order Primal-Dual Algorithm for Convex Problems with Applications to ImagingJournal of Mathematical Imaging and Vision, 2010
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse ProblemsSIAM Journal on Imaging Sciences, 2009
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral caseNumerical Functional Analysis and Optimization, 1994
- A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces1986