Skip to content
nonconvexcard

The exact step-size threshold on a quadratic

ProofBeginner⏱ 15 minOptimizationstep sizestabilitydivergencequadratic

Problem

For f(x)=12x⊤Axf(x) = \frac12x^\top Ax with AA symmetric positive definite with eigenvalues in [μ,L][\mu, L], show that gradient descent with step η\eta gives xt=(I−ηA)tx0x_t = (I-\eta A)^tx_0, and determine exactly the set of η\eta for which xt→0x_t\to0 for every x0x_0. Find the η\eta 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
SolvedProblemFieldTypeDifficultyTime
Linear convergence under strong convexityOptimizationProofIntermediate30 min
Logistic regression diverges on separable dataClassical MLProofIntermediate30 min
Non-convex gradient descent reaches an approximate stationary pointOptimizationProofIntermediate30 min
Reading the Robbins–Monro conditions off the proofSGDProofIntermediate30 min
Gradient descent with exact line search on a quadraticOptimizationProofAdvanced1 hour