Pages that link to "Item:Q6038652"
From MaRDI portal
The following pages link to An optimal gradient method for smooth strongly convex minimization (Q6038652):
Displaying 29 items.
- New results on subgradient methods for strongly convex optimization problems with a unified analysis (Q316174) (← links)
- A first order method for finding minimal norm-like solutions of convex optimization problems (Q463716) (← links)
- Universal gradient methods for convex optimization problems (Q494332) (← links)
- Dynamic smoothness parameter for fast gradient methods (Q683921) (← links)
- A recovered gradient method applied to smooth optimal shape problems (Q1363449) (← links)
- On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions (Q1679617) (← links)
- Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach (Q2031939) (← links)
- Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences (Q2044479) (← links)
- On the oracle complexity of smooth strongly convex minimization (Q2052164) (← links)
- Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
- Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
- Oracle complexity of second-order methods for smooth convex optimization (Q2330652) (← links)
- Explicit stabilised gradient descent for faster strongly convex optimisation (Q2660598) (← links)
- Fast gradient methods for uniformly convex and weakly smooth problems (Q2673504) (← links)
- On lower and upper bounds in smooth and strongly convex optimization (Q2834440) (← links)
- (Q3779681) (← links)
- Generalizing the Optimized Gradient Method for Smooth Convex Minimization (Q4571883) (← links)
- Gradient methods with memory (Q5043847) (← links)
- Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization (Q5093649) (← links)
- Optimal Affine-Invariant Smooth Minimization Algorithms (Q5376450) (← links)
- An acceleration procedure for optimal first-order methods (Q5746718) (← 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)
- An elementary approach to tight worst case complexity analysis of gradient based methods (Q6165581) (← links)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
- Provably faster gradient descent via long steps (Q6579999) (← links)
- Interpolation conditions for linear operators and applications to performance estimation problems (Q6601207) (← links)
- PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python (Q6645946) (← links)
- Accelerated minimax algorithms flock together (Q6663115) (← links)
