Extrema and Constrained Extrema
Definition
A definition is a precise description of what a concept, a term, or an object means. Understanding definitions is the foundation of learning any field, and every concept has its own exact meaning.
Let be defined on a neighborhood of . If for every point in that neighborhood,
then has a local maximum (or local minimum) at , and is called a maximum point (or minimum point). Maxima and minima together are called extrema.
Note: an extremum is a local concept—it compares with values near the point only, not global maxima/minima over the whole domain. A function may have several maxima and minima, and a local maximum need not exceed a local minimum.
Necessary Condition — Fermat’s Theorem
Theorem
A theorem is a proposition that has been rigorously proved, and it is the foundation of mathematical reasoning. A theorem usually states its conditions and its conclusion, and is an important part of any mathematical system.
Fermat’s theorem (necessary condition): if has partial derivatives at and attains an extremum there, then
For an -variable function, all first partials vanish at an extremum:
Cautions:
- The necessary condition requires the partial derivatives to exist. If they do not, the function can still attain an extremum—e.g. has a minimum at where the partials do not exist.
- Vanishing partials are necessary but not sufficient: a point with zero gradient need not be an extremum (it may be a saddle point).
Definition
A definition is a precise description of what a concept, a term, or an object means. Understanding definitions is the foundation of learning any field, and every concept has its own exact meaning.
A point where both first partial derivatives vanish, i.e.
is called a stationary point (or critical point). More generally, any point with is a stationary point.
Relation between extrema and stationary points:
- A differentiable extremum point is always a stationary point (necessary condition).
- A stationary point need not be an extremum (it may be a saddle point).
- An extremum point may fail to be stationary if partials do not exist.
So candidate points are: (1) stationary points (), and (2) points where partial derivatives do not exist. Then use a sufficient condition (second-derivative test) or the definition to decide.
Saddle Point
Definition
A definition is a precise description of what a concept, a term, or an object means. Understanding definitions is the foundation of learning any field, and every concept has its own exact meaning.
A stationary point that is neither a local maximum nor a local minimum is called a saddle point—the surface goes up along some directions and down along others, like a horse’s saddle.
Definition
A definition is a precise description of what a concept, a term, or an object means. Understanding definitions is the foundation of learning any field, and every concept has its own exact meaning.
The Hessian matrix of at a stationary point is
Theorem
A theorem is a proposition that has been rigorously proved, and it is the foundation of mathematical reasoning. A theorem usually states its conditions and its conclusion, and is an important part of any mathematical system.
Second-derivative test: let be a stationary point, and set
- If and : local minimum.
- If and : local maximum.
- If : saddle point.
- If : the test is inconclusive.
Example 1: Second-Derivative Test
Find the extrema of .
Approach:
Classify a stationary point by evaluating the second partial derivatives and the discriminant built from them.
Steps:
- Stationary point: , , so .
- Second derivatives:
- , and : local minimum.
Answer: local (and global) minimum at .
Example 2: Saddle Point
Find the extrema of .
Approach:
A negative discriminant means the Hessian is indefinite, so the point is a saddle rather than an extremum.
Steps:
- Stationary point: , , so .
- : saddle point.
Answer: is a saddle point—not an extremum.
Definition
A definition is a precise description of what a concept, a term, or an object means. Understanding definitions is the foundation of learning any field, and every concept has its own exact meaning.
Finding the extremum of (the objective function) subject to the constraint is called a constrained extremum problem. In general:
Unconstrained vs constrained:
- Unconstrained: the variables range freely over the domain.
- Constrained: the variables must satisfy constraint equations; the extremum is confined to the constraint surface.
Two solution methods:
- Substitution: solve the constraint for some variables and substitute into the objective function to reduce to an unconstrained problem. Fails when the constraint is complicated.
- Lagrange multipliers: introduce multipliers to turn the problem into a system of equations. This is the general method.
Lagrange Multiplier Method (Single Constraint)
Theorem
A theorem is a proposition that has been rigorously proved, and it is the foundation of mathematical reasoning. A theorem usually states its conditions and its conclusion, and is an important part of any mathematical system.
To find possible extrema of subject to , form the Lagrangian:
where is the Lagrange multiplier. Set all first partials to zero:
Solving this system gives the candidate constrained extremum points.
Intuition: at a constrained extremum, the gradient of the objective function is parallel to the gradient of the constraint——so the level curves of are tangent to the constraint curve.
Example 3: Lagrange Multipliers
Maximize subject to .
Approach:
To extremize a function subject to a constraint, build the Lagrangian and set all of its partial derivatives to zero together with the constraint equation.
Steps:
- Lagrangian:
- Set partials to zero:
- From the first two:
- Substitute:
- gives ; gives
- ,
Answer: maximum at ; minimum at .
Symbols Used in This Article
| Symbol | Type | Pronunciation/Explanation | Meaning in This Article |
|---|---|---|---|
| Partial derivative | f sub x, f sub y | First partial derivatives | |
| Number | A, B, C | at a stationary point | |
| Greek letter | Delta | The discriminant | |
| Greek letter | Lambda | The Lagrange multiplier | |
| Function | L | The Lagrangian function | |
| Greek letter | phi | The constraint function | |
| Vector | nabla f | The gradient of |
