Pages that link to "Item:Q3462314"

The following pages link to Distributed Block Coordinate Descent for Minimizing Partially Separable Functions (Q3462314):

Displaying 11 items.

• On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes (Q1711086) (← links)
• Matrix completion under interval uncertainty (Q1752160) (← links)
• High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
• Coordinate descent algorithms (Q2349114) (← links)
• A framework for parallel second order incremental optimization algorithms for solving partially separable problems (Q2419531) (← links)
• On the convergence analysis of asynchronous SGD for solving consistent linear systems (Q2685380) (← links)
• Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent (Q2832112) (← links)
• Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (Q4634141) (← links)
• On the complexity of parallel coordinate descent (Q4638927) (← links)
• Distributed Stochastic Optimization with Large Delays (Q5868949) (← links)
• Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training (Q6076869) (← links)