1.2.10 · D3Calculus & Optimization Basics

Worked examples — Critical points and saddle points

2,885 words13 min readBack to topic

This page is a workout. We will not learn new theory — we take the parent tools (gradient, Hessian, eigenvalues) and drive them through every kind of situation that can appear: every sign pattern of the curvature, the awkward zero cases, the degenerate cases where the usual test breaks, a physical word problem, and an exam twist.

Before any symbol appears, here is the one picture that anchors everything.

Figure — Critical points and saddle points

The scenario matrix

Every critical-point problem is one of these cells. The examples below each carry the cell tag they resolve, so together they tile the whole table.

Cell What makes it special Curvature signature Answer type
A 1-D, clean second derivative or min / max
B 1-D, second derivative zero , use higher term inflection / degenerate
C 2-D bowl both local minimum
D 2-D dome both local maximum
E 2-D mixed signs saddle
F 2-D with a zero eigenvalue one degenerate (flat valley)
G Off-diagonal Hessian (cross term) must diagonalise first depends on eigenvalues
H High-D "one bad direction" positive, negative saddle (ML trap)
I Word problem (physics / economics) translate → classify applied min/max
J Exam twist: many critical points classify each separately mixed

Example A — one variable, textbook minimum (and its mirror maximum)


Example B — one variable, the test fails (two flavours)


Example C, D, E — the 2-D trio in one shot

These three cells differ only in the sign pattern of the two eigenvalues. See the surfaces:

Figure — Critical points and saddle points

Example F — the degenerate flat valley (zero eigenvalue)


Example G — off-diagonal Hessian: you MUST diagonalise


Example H — high-dimensional "one bad direction" (the ML saddle)


Example I — word problem: the cheapest can


Example J — exam twist: several critical points at once


Recall Quick self-test

Which cell does at the origin fall in, and why? ::: Cell F (degenerate): Hessian is ; the zero eigenvalue direction gives which falls, so it is a saddle — the Hessian couldn't decide, higher terms did. If a -parameter Hessian has one negative eigenvalue, minimum or saddle? ::: Saddle — a single negative eigenvalue means an escape direction exists (Cell H). Why can't you read the diagonal of to classify? ::: Off-diagonal terms mean the coordinate axes aren't the principal axes; you must find eigenvalues ( and ) first (Cell G).

See also: Second-Order Optimization, Loss Landscape Visualization, Convex Optimization, Taylor Series, Eigenvalues and Eigenvectors.