Pages that link to "Item:Q2060942"
From MaRDI portal
The following pages link to On the convergence of a randomized block coordinate descent algorithm for a matrix least squares problem (Q2060942):
Displaying 12 items.
- A new randomized Gauss-Seidel method for solving linear least-squares problems (Q2021500) (← links)
- On the convergence of a block-coordinate incremental gradient method (Q2100401) (← links)
- Randomized primal-dual proximal block coordinate updates (Q2314059) (← links)
- Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516) (← links)
- A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares (Q2796799) (← links)
- Randomized sparse block Kaczmarz as randomized dual block-coordinate descent (Q2806702) (← links)
- Acceleration of block coordinate descent method achieves the $\bm{O(\frac{1}{k^2})}$ rate of convergence for a convex function with block coordinate strong convexity (Q5063626) (← links)
- Convergence of a block coordinate descent method for nondifferentiable minimization (Q5945065) (← links)
- Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices (Q6101125) (← links)
- On convergence of a sketch-and-project method for the matrix equation \(AXB = C\) (Q6576445) (← links)
- A residual-based surrogate hyperplane extended Kaczmarz algorithm for large least squares problems (Q6599784) (← links)
- On the randomized block Kaczmarz algorithms for solving matrix equation \(A X B = C\) (Q6664931) (← links)
