Pages that link to "Item:Q5375972"

The following pages link to Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems (Q5375972):

Displaying 7 items.

• Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
• Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces (Q2168686) (← links)
• Convergence of online pairwise regression learning with quadratic loss (Q2191834) (← links)
• PhaseMax: Stable guarantees from noisy sub-Gaussian measurements (Q5132229) (← links)
• Accelerate stochastic subgradient method by leveraging local growth condition (Q5236746) (← links)
• Robust randomized optimization with k nearest neighbors (Q5236747) (← links)
• On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization (Q6158001) (← links)