Pages that link to "Item:Q2829565"

The following pages link to Coordinate descent with arbitrary sampling I: algorithms and complexity^† (Q2829565):

Displaying 18 items.

• An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems (Q825333) (← links)
• Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods (Q2023684) (← links)
• Fastest rates for stochastic mirror descent methods (Q2044496) (← links)
• Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis (Q2133415) (← links)
• Accelerating block coordinate descent methods with identification strategies (Q2419524) (← links)
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function (Q2452370) (← links)
• Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent (Q2832112) (← links)
• Randomized Iterative Methods for Linear Systems (Q3456879) (← links)
• (Q4558169) (← links)
• On the complexity of parallel coordinate descent (Q4638927) (← links)
• Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications (Q4687241) (← links)
• (Q4999081) (← links)
• Proximal Gradient Methods with Adaptive Subspace Sampling (Q5026438) (← links)
• Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory (Q5112239) (← links)
• A discrete dynamics approach to sparse calculation and applied in ontology science (Q5205890) (← links)
• Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems (Q5375972) (← links)
• Convergence Analysis of Inexact Randomized Iterative Methods (Q5856678) (← links)
• Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)