Pages that link to "Item:Q5108265"

The following pages link to On the Efficiency of Random Permutation for ADMM and Coordinate Descent (Q5108265):

Displayed 7 items.

• Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization (Q823888) ‎ (← links)
• Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems (Q2112682) ‎ (← links)
• Near-linear convergence of the random Osborne algorithm for matrix balancing (Q2687049) ‎ (← links)
• Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version (Q5162659) ‎ (← links)
• Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations (Q6114955) ‎ (← links)
• Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency (Q6130543) ‎ (← links)
• A linear algebra perspective on the random multi-block ADMM: the QP case (Q6142559) ‎ (← links)