3 citations · 3 across the 2 of their papers we have counts for
3 papers
math.OC2025
On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms
Yassine Kamri, François Glineur, Julien M. Hendrickx +1
We study the worst-case behavior of Block Coordinate Descent (BCD) type algorithms for unconstrained minimization of coordinate-wise smooth convex functions. This behavior is indee…
math.OC2019
Faster randomized block Kaczmarz algorithms
Ion Necoara
The Kaczmarz algorithm is a simple iterative scheme for solving consistent linear systems. At each step, the method projects the current iterate onto the solution space of a single…
math.OC2015★ 3 cited
Random block coordinate descent methods for linearly constrained optimization over networks
I. Necoara, Yu. Nesterov, F. Glineur
In this paper we develop random block coordinate gradient descent methods for minimizing large scale linearly constrained separable convex problems over networks. Since we have cou…