Pages that link to "Item:Q511109"
From MaRDI portal
The following pages link to The exact information-based complexity of smooth convex minimization (Q511109):
Displaying 19 items.
- On the convergence analysis of the optimized gradient method (Q511969) (← links)
- Adaptive restart of the optimized gradient method for convex optimization (Q1670019) (← links)
- Exact worst-case convergence rates of the proximal gradient method for composite convex minimization (Q1670100) (← links)
- Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions (Q2026726) (← links)
- Some worst-case datasets of deterministic first-order methods for solving binary logistic regression (Q2028922) (← links)
- On the oracle complexity of smooth strongly convex minimization (Q2052164) (← links)
- Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
- Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
- Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
- Generalizing the Optimized Gradient Method for Smooth Convex Minimization (Q4571883) (← links)
- Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA) (Q4603039) (← links)
- Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization (Q5093649) (← links)
- Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection (Q5123997) (← links)
- Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization (Q5275297) (← links)
- On the Properties of Convex Functions over Open Sets (Q5856375) (← links)
- Bilevel Methods for Image Reconstruction (Q5870782) (← links)
- An optimal gradient method for smooth strongly convex minimization (Q6038652) (← links)
- Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods (Q6073850) (← links)
- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods (Q6120850) (← links)