Skip to content

Cheatsheet: Convexity, Smoothness & Strong Convexity Equivalences ​


1 Convexity Equivalences ​

For a twice-differentiable f:D→R on convex D⊆Rn, the following are equivalent:

  1. Basic Convexity: f(θx+(1−θ)y)≤θf(x)+(1−θ)f(y), ∀θ∈[0,1].
  2. First-Order Condition (FOC): f(y)≥f(x)+∇f(x)⊤(y−x), ∀x,y∈D.
  3. Gradient Monotonicity (GM): ⟨∇f(x)−∇f(y),x−y⟩≥0, ∀x,y∈D.
  4. Second-Order Condition (SOC): ∇2f(x)⪰0 (Hessian PSD).

Convexity ⟺ FOC ​

(⇒) Assume f convex. For θ∈(0,1]:

f(x+θ(y−x))≤(1−θ)f(x)+θf(y)⟹f(x+θ(y−x))−f(x)θ≤f(y)−f(x)

Take θ→0: ∇f(x)⊤(y−x)≤f(y)−f(x).

(⇐) Assume FOC holds. Let z=θx+(1−θ)y:

f(x)≥f(z)+∇f(z)⊤(x−z)f(y)≥f(z)+∇f(z)⊤(y−z)

Multiply by θ and (1−θ) respectively and add:

θf(x)+(1−θ)f(y)≥f(z)+∇f(z)⊤(θx+(1−θ)y−z⏟=0)=f(z)

FOC ⟺ GM ​

(⇒) Write FOC twice swapping x,y and add:

f(y)≥f(x)+∇f(x)⊤(y−x)f(x)≥f(y)+∇f(y)⊤(x−y)⟹0≥∇f(x)⊤(y−x)+∇f(y)⊤(x−y)⟹⟨∇f(x)−∇f(y),x−y⟩≥0

(⇐) By FTC along x+t(y−x):

f(y)−f(x)=∫01∇f(x+t(y−x))⊤(y−x)dt

Subtract the tangent at x:

f(y)−f(x)−∇f(x)⊤(y−x)=∫01(∇f(xt)−∇f(x))⊤(y−x)dt

By GM, integrand is ≥0. Thus f(y)≥f(x)+∇f(x)⊤(y−x).

GM ⟺ SOC ​

(⇒) For y=x+ϵd, GM implies (∇f(x+ϵd)−∇f(x))⊤dϵ≥0. Take ϵ→0: d⊤∇2f(x)d≥0.

(⇐) By FTC:

∇f(y)−∇f(x)=∫01∇2f(x+t(y−x))(y−x)dt⟹(∇f(y)−∇f(x))⊤(y−x)=∫01(y−x)⊤∇2f(xt)(y−x)dt≥0

2 L-Smoothness Equivalences ​

For a twice-differentiable f, the following are equivalent definitions of L-smoothness:

  1. Lipschitz Continuous Gradient: ∥∇f(x)−∇f(y)∥≤L∥x−y∥, ∀x,y∈D.
  2. Alternative (Convexity): g(x)=L2∥x∥2−f(x) is convex.
  3. Descent Lemma: f(y)≤f(x)+∇f(x)⊤(y−x)+L2∥y−x∥2.
  4. Hessian Bound: ∇2f(x)⪯L⋅I, ∀x∈D.

Lipschitz Gradient ⟺ Hessian Bound ​

(⇒) Let v be a unit vector. By definition of Hessian:

∇2f(x)v=limh→0∇f(x+hv)−∇f(x)h

Taking norms and using Lipschitz:

∥∇2f(x)v∥≤limh→0L∥hv∥h=L⟹∇2f(x)⪯L⋅I

(⇐) By FTC on gradient:

∥∇f(y)−∇f(x)∥=‖∫01∇2f(x+t(y−x))(y−x)dt‖≤∫01∥∇2f(xt)∥2⋅∥y−x∥dt≤L∥y−x∥

Hessian Bound ⟺ Alternative Definition ​

g(x)=L2∥x∥2−f(x). Compute Hessian:

∇2g(x)=L⋅I−∇2f(x)

g is convex ⟺∇2g(x)⪰0⟺∇2f(x)⪯L⋅I.

Alternative ⟺ Descent Lemma ​

If g is convex, by standard FOC: g(y)≥g(x)+∇g(x)⊤(y−x). Substitute g(x)=L2∥x∥2−f(x), ∇g(x)=Lx−∇f(x):

L2∥y∥2−f(y)≥L2∥x∥2−f(x)+(Lx−∇f(x))⊤(y−x)

Rearrange:

f(y)≤f(x)+∇f(x)⊤(y−x)+L2(∥y∥2−∥x∥2−2x⊤(y−x))=f(x)+∇f(x)⊤(y−x)+L2∥y−x∥2

Direct: Lipschitz Gradient ⇒ Descent Lemma ​

By FTC:

f(y)−f(x)−∇f(x)⊤(y−x)=∫01(∇f(xt)−∇f(x))⊤(y−x)dt

Apply Cauchy-Schwarz and Lipschitz:

≤∫01∥∇f(xt)−∇f(x)∥⋅∥y−x∥dt≤∫01L⋅t∥y−x∥⋅∥y−x∥dt=L2∥y−x∥2

3 Gradient Descent Convergence ​

Gradient descent update: xt+1=xt−η∇f(xt).

3.1 Smooth Functions (L-smooth, step size η=1/L) ​

Descent Lemma:

f(xt+1)≤f(xt)−12L∥∇f(xt)∥2

Convergence to stationary point (O(1/T)):

min0≤t≤T−1∥∇f(xt)∥2≤2L(f(x0)−f(x∗))T

3.2 Smooth & Convex Functions (η=1/L) ​

Convergence rate (O(1/T)):

f(xT)−f(x∗)≤L2T∥x0−x∗∥2

Derivation sketch: From convexity FOC, ∇f(xt)⊤(xt−x∗)≥f(xt)−f(x∗). Combined with distance contraction:

∥xt+1−x∗∥2≤∥xt−x∗∥2−2L(f(xt+1)−f(x∗))

Telescoping sum yields the bound.

3.3 Smooth & Strongly Convex Functions (η=1/L, m>0) ​

Linear convergence:

f(xT)−f(x∗)≤(1−mL)T[f(x0)−f(x∗)]

Key inequalities:

  • Descent Lemma: f(xt+1)≤f(xt)−12L∥∇f(xt)∥2
  • Gradient Lower Bound (from m-strong convexity): ∥∇f(x)∥2≥2m(f(x)−f(x∗))
  • Substitute: f(xt+1)−f(x∗)≤(f(xt)−f(x∗))−mL(f(xt)−f(x∗))
  • Condition number κ=L/m; smaller κ gives faster convergence.

4 Strong Convexity Equivalences ​

For a twice-differentiable f:D→R on convex D⊆Rn, the following are equivalent (m>0):

  1. Alternative Definition: h(x)=f(x)−m2∥x∥2 is convex.
  2. Strong FOC: f(y)≥f(x)+∇f(x)⊤(y−x)+m2∥y−x∥2.
  3. Strong GM: ⟨∇f(x)−∇f(y),x−y⟩≥m∥x−y∥2.
  4. Strong SOC: ∇2f(x)⪰m⋅I, ∀x∈D.

Alternative ⟺ Strong SOC ​

Define h(x)=f(x)−m2∥x∥2. Then:

∇h(x)=∇f(x)−mx∇2h(x)=∇2f(x)−mI

h convex ⟺∇2h(x)⪰0⟺∇2f(x)⪰mI.

Alternative ⟺ Strong FOC ​

(⇒) h convex ⟹ standard FOC for h:

h(y)≥h(x)+∇h(x)⊤(y−x)

Substitute h(x)=f(x)−m2∥x∥2, ∇h(x)=∇f(x)−mx:

f(y)−m2∥y∥2≥f(x)−m2∥x∥2+(∇f(x)−mx)⊤(y−x)

Rearrange quadratic terms:

m2∥y∥2−m2∥x∥2−mx⊤(y−x)=m2∥y−x∥2⟹f(y)≥f(x)+∇f(x)⊤(y−x)+m2∥y−x∥2

(⇐) Assume strong FOC holds. Compute:

h(y)−h(x)−∇h(x)⊤(y−x)=[f(y)−f(x)−∇f(x)⊤(y−x)]−m2∥y−x∥2

By strong FOC, the bracket ≥m2∥y−x∥2. Thus:

h(y)−h(x)−∇h(x)⊤(y−x)≥0⟹h convex

Strong FOC ⟺ Strong GM ​

(⇒) Write strong FOC twice:

f(y)≥f(x)+∇f(x)⊤(y−x)+m2∥y−x∥2f(x)≥f(y)+∇f(y)⊤(x−y)+m2∥x−y∥2

Add and cancel f(x)+f(y):

0≥∇f(x)⊤(y−x)+∇f(y)⊤(x−y)+m∥x−y∥2⟹⟨∇f(x)−∇f(y),x−y⟩≥m∥x−y∥2

(⇐) Fix x,y, define xt=x+t(y−x). By FTC:

f(y)−f(x)=∫01∇f(xt)⊤(y−x)dt

Add/subtract ∇f(x):

=∇f(x)⊤(y−x)+∫01(∇f(xt)−∇f(x))⊤(y−x)dt

Apply strong GM with u=xt, v=x:

(∇f(xt)−∇f(x))⊤(t(y−x))≥m∥t(y−x)∥2=mt2∥y−x∥2

Divide by t, integrate:

∫01(∇f(xt)−∇f(x))⊤(y−x)dt≥∫01mt∥y−x∥2dt=m2∥y−x∥2⟹f(y)≥f(x)+∇f(x)⊤(y−x)+m2∥y−x∥2