Cyclic coordinate descent in the Hölder smooth setting
- 16 June 2022
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 50 (5) , 458-462
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz ContinuitySIAM Journal on Optimization, 2019
- Radial Subgradient MethodSIAM Journal on Optimization, 2018
- Relatively Smooth Convex Optimization by First-Order Methods, and ApplicationsSIAM Journal on Optimization, 2018
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and ApplicationsMathematics of Operations Research, 2017
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradientsOptimization Letters, 2015
- On the Convergence of Block Coordinate Descent Type MethodsSIAM Journal on Optimization, 2013
- 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
- Randomized Methods for Linear Constraints: Convergence Rates and ConditioningMathematics of Operations Research, 2010
- A forward–backward splitting algorithm for the minimization of non-smooth convex functionals in Banach spaceInverse Problems, 2008