The exact step-size threshold on a quadratic
ProofBeginner⏱ 15 minOptimizationstep sizestabilitydivergencequadratic
Problem
For with symmetric positive definite with eigenvalues in , show that gradient descent with step gives , and determine exactly the set of for which for every . Find the minimising the worst-case contraction factor.
Write a complete argument. Every inequality you use should be one you could state precisely.
Solution
Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.
Related problems
All problems| Solved | Problem | Field | Type | Difficulty | Time |
|---|---|---|---|---|---|
| Linear convergence under strong convexity | Optimization | Proof | 30 min | ||
| Logistic regression diverges on separable data | Classical ML | Proof | 30 min | ||
| Non-convex gradient descent reaches an approximate stationary point | Optimization | Proof | 30 min | ||
| Reading the Robbins–Monro conditions off the proof | SGD | Proof | 30 min | ||
| Gradient descent with exact line search on a quadratic | Optimization | Proof | 1 hour |