Cyclic coordinate descent in the Hölder smooth setting
From MaRDI portal
Publication:2084003
DOI10.1016/J.ORL.2022.06.002OpenAlexW4283010137MaRDI QIDQ2084003
David H. Gutman, Nam Ho-Nguyen
Publication date: 17 October 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2022.06.002
Cites Work
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- A forward–backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space
- First-Order Methods in Optimization
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- Radial Subgradient Method
- Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity
- On the Convergence of Block Coordinate Descent Type Methods
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
This page was built for publication: Cyclic coordinate descent in the Hölder smooth setting
