NICEFA Logo
nicefa.
Library
←Module

Local Optima are Global Optima for Convex Functions

Exploring the cinematic intuition of Local Optima are Global Optima for Convex Functions.

Visualizing...

Our institutional research engineers are currently mapping the formal proof for Local Optima are Global Optima for Convex Functions.

Apply for Institutional Early Access →

The Formal Theorem

Let f:S→R f: S \to \mathbb{R} be a convex function defined on a convex set S⊆Rn S \subseteq \mathbb{R}^n . If x∗∈S x^* \in S is a local minimum of f f , then x∗ x^* is a global minimum of f f . That is, for all x∈S x \in S :
f(x∗)≤f(x) f(x^*) \leq f(x)

Analytical Intuition.

Imagine you are trekking across a mountain landscape that follows the bowl-like geometry of a convex function. In a non-convex world, you might find yourself trapped in a 'false' valley—a local dip surrounded by higher peaks, masking a much deeper canyon elsewhere. However, convexity forbids these deceptive pockets. Because the function is defined by the property that any chord connecting two points on the graph stays above or on the graph, the surface is essentially 'bottom-weighted.' If you find a point x∗ x^* where every step in any direction leads you 'uphill' (even if only for a short distance), you are not just in a small hollow; you are at the floor of the entire landscape. The very shape of the function acts as a global constraint: if f f were to dip lower somewhere else, the line segment connecting your current point x∗ x^* and that hypothetical lower point would violate the curvature requirement. Thus, in the land of convexity, a local foothold is a global conquest.
CAUTION

Institutional Warning.

Students often conflate convexity with strict convexity. While local minima are global for both, strict convexity additionally guarantees that the global minimum is unique. Also, students frequently confuse local minima on a set with stationary points where the gradient is zero.

Academic Inquiries.

01

Does this theorem apply to concave functions?

Yes, but with reversed results: for a concave function, any local maximum is necessarily a global maximum.

02

What if the function is convex but not differentiable?

The theorem holds regardless of differentiability. Convexity is a structural property of the function's domain and epigraph, not its derivative.

Standardized References.

  • Definitive Institutional SourceStephen Boyd and Lieven Vandenberghe, Convex Optimization

Related Proofs Cluster.

Intermediate

Weierstrass Extreme Value Theorem: Guaranteeing Existence of Optima

Exploring the cinematic intuition of Weierstrass Extreme Value Theorem: Guaranteeing Existence of Optima.

Intermediate

Hessian Matrix and Second-Order Optimality Conditions

Exploring the cinematic intuition of Hessian Matrix and Second-Order Optimality Conditions.

Intermediate

Jensen's Inequality for Convex Functions

Exploring the cinematic intuition of Jensen's Inequality for Convex Functions.

Intermediate

Proof that the Intersection of Convex Sets is Convex

Exploring the cinematic intuition of Proof that the Intersection of Convex Sets is Convex.

Institutional Citation

Reference this proof in your academic research or publications.

NICEFA Visual Mathematics. (2026). Local Optima are Global Optima for Convex Functions: Visual Proof & Intuition. Retrieved from https://nicefa.org/library/fundamentals-of-optimization/local-optima-are-global-optima-for-convex-functions

Dominate the Logic.

"Abstract theory is just a movement we haven't seen yet."

Subscribe for Full ProofsEarly Access