Strong convexity gradient inequality

ID: strong-convexity-gradient-inequality

For a differentiable strongly convex function with modulus and global minimizer , the supporting inequality gives
Completing the square shows that the last two terms are at least , which proves the result. Combining this with the descent lemma converts squared gradient decrease into a contraction of the objective function gap.
Target: mathematical-optimization.bigb, under Line search.

New to topics? Read the docs here!