The randomized block coordinate descent method in the Hölder smooth setting
- 8 November 2024
- journal article
- research article
- Published by Springer Nature in Optimization Letters
- Vol. 19 (1) , 1-20
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- General Hölder Smooth Convergence Rates Follow from Specialized Rates Assuming Growth BoundsJournal of Optimization Theory and Applications, 2023
- Multi-Scale Zero-Order Optimization of Smooth Functions in an RKHS2022
- Cyclic coordinate descent in the Hölder smooth settingOperations Research Letters, 2022
- Zeroth-order methods for noisy Hölder-gradient functionsOptimization Letters, 2021
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradientsOptimization Letters, 2015
- Universal gradient methods for convex optimization problemsMathematical Programming, 2014
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite functionMathematical Programming, 2012
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization ProblemsSIAM Journal on Optimization, 2012
- A forward–backward splitting algorithm for the minimization of non-smooth convex functionals in Banach spaceInverse Problems, 2008
- Optimal methods of smooth convex minimizationUSSR Computational Mathematics and Mathematical Physics, 1985