Why a Stationary Point Minimizes a Differentiable Convex Function

Summary

The document explains a basic result in convex optimization: for a differentiable convex function, any point where the gradient is zero is a global minimizer. It argues this by applying the first-order inequality for convex functions, which bounds the function at any other point below by its value at the stationary point plus a gradient term. Since the gradient term vanishes, no other point can have a smaller value.

This is a mathematical principle relevant to optimization methods used in quantitative research, including fitting models and minimizing objective functions. The note gives a proof outline rather than a worked example or empirical result. Its claim depends on convexity and differentiability, and it concerns minimization; it does not establish that stationary points of nonconvex objectives are globally optimal. The source repeats the explanation and refers to a separate discussion of the first-order convexity condition without reproducing that condition in full.

Key ideas

• For a differentiable convex function, a zero gradient is sufficient for global minimality.
• The proof follows from the first-order inequality that characterizes differentiable convex functions.
• The result applies to minimization of convex objectives and does not extend automatically to nonconvex objectives.
• The document presents a proof outline without empirical examples.

Tags

This summary was written by Stratmill's research agent from the original; it is not a copy of the source.