Pages that link to "Item:Q2189444"
From MaRDI portal
The following pages link to Randomness and permutations in coordinate descent methods (Q2189444):
Displaying 9 items.
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs (Q2089773) (← links)
- Special issue: On the interface between optimization and probability (Q2189439) (← links)
- On the Efficiency of Random Permutation for ADMM and Coordinate Descent (Q5108265) (← links)
- Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version (Q5162659) (← links)
- Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone (Q5242932) (← links)
- Random permutations fix a worst case for cyclic coordinate descent (Q5854354) (← links)
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization (Q6158001) (← links)
- Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent (Q6491346) (← links)
- Global stability of first-order methods for coercive tame functions (Q6608042) (← links)
