An optimal lower bound for smooth convex functions
From MaRDI portal
Cites work
- A Generalized Accelerated Composite Gradient Method: Uniting Nesterov's Fast Gradient Method and FISTA
- An Accelerated Composite Gradient Method for Large-Scale Composite Objective Problems
- An adaptive accelerated first-order method for convex optimization
- Convex Analysis
- Efficient first-order methods for convex minimization: a constructive approach
- Exact gradient methods with memory
- Gradient methods for minimizing composite functions
- Gradient methods with memory
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Linear convergence of first order methods for non-strongly convex optimization
- MM optimization algorithms
- On the convergence analysis of the optimized gradient method
- On the oracle complexity of smooth strongly convex minimization
- Optimized first-order methods for smooth convex minimization
- Performance of first-order methods for smooth convex minimization: a novel approach
- Smooth minimization of non-smooth functions
- The exact information-based complexity of smooth convex minimization
This page was built for publication: An optimal lower bound for smooth convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880489)