Pages that link to "Item:Q2673504"
From MaRDI portal
The following pages link to Fast gradient methods for uniformly convex and weakly smooth problems (Q2673504):
Displaying 13 items.
- New results on subgradient methods for strongly convex optimization problems with a unified analysis (Q316174) (← links)
- Universal gradient methods for convex optimization problems (Q494332) (← links)
- Dynamic smoothness parameter for fast gradient methods (Q683921) (← links)
- Fast proximity-gradient algorithms for structured convex optimization problems (Q739473) (← links)
- Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences (Q2044479) (← links)
- A family of subgradient-based methods for convex optimization problems in a unifying framework (Q2829570) (← links)
- Fast Curvature Matrix-Vector Products for Second-Order Gradient Descent (Q3150014) (← links)
- (Q3779681) (← links)
- A universal modification of the linear coupling method (Q4631767) (← links)
- Convex Synthesis of Accelerated Gradient Algorithms (Q5020736) (← links)
- Faster <i>p</i>-norm minimizing flows, via smoothed <i>q</i>-norm problems (Q5146825) (← links)
- Uniform rank gradient, cost, and local-global convergence (Q5218237) (← links)
- An Optimized Dynamic Mode Decomposition Model Robust to Multiplicative Noise (Q5887849) (← links)
