On lower and upper bounds in smooth and strongly convex optimization

Keyphrases

• Optimization Algorithm 100%
• Strongly Convex Optimization 100%
• Smooth Optimization 100%
• Optimization Problem 50%
• Motivation 50%
• New Lower Bound 50%
• Nesterov 50%
• Gradient Method 50%
• Natural Interpretation 50%
• Linear Operator 50%
• New Upper Bound 50%
• Accelerated Gradient Method 50%
• Quadratic Function 50%
• Convex Optimization Algorithm 50%
• Number of Iterations 50%
• Systematic Derivation 50%
• Recursive Application 50%
• Natural Regime 50%
• Analytic Theory 50%

Mathematics

• Polynomial 100%
• Lower and upper bounds 100%
• Linear Operator 50%
• Quadratic Function 50%