Pages that link to "Item:Q5501228"
From MaRDI portal
The following pages link to Iteration Complexity of a Block Coordinate Gradient Descent Method for Convex Optimization (Q5501228):
Displaying 6 items.
- A stochastic subspace approach to gradient-free optimization in high dimensions (Q2044475) (← links)
- On the convergence of a block-coordinate incremental gradient method (Q2100401) (← links)
- (Q2934047) (← links)
- (Q4198634) (← links)
- Acceleration of block coordinate descent method achieves the $\bm{O(\frac{1}{k^2})}$ rate of convergence for a convex function with block coordinate strong convexity (Q5063626) (← links)
- (Q5155916) (← links)