Solving with Lagrange — A Worked Example
Let us minimize subject to (a circle of radius ).
The Jacobians are and . The Lagrange condition gives two equations: and .
Assuming : divide the first by and the second by to isolate . Equating gives — a curve. Intersect this with the constraint circle to get candidate points.
Special cases ( or ) must be handled separately. For each candidate, evaluate to find the minimum. The key point: Lagrange finds a finite list of candidates; we just evaluate at each and pick the best.
Formal View
Why This Matters
Solving constrained systems appears in physics, economics, engineering design, and statistical estimation. Lagrange is the standard first tool.
- Finding eigenvalues of symmetric matrices (next section shows this)
- Maximum likelihood estimation with constraints in statistics
- Optimal control: trajectory optimization with dynamics constraints
- Chemical equilibrium: minimize free energy subject to stoichiometric constraints
Quiz
To find constrained optima using Lagrange multipliers, you solve:
After finding all constrained Lagrange points, how do you identify the minimum?
Special cases like or must be checked separately in Lagrange problems.
For s.t. , the Lagrange condition gives:
Minimize s.t. . The constrained minimum is at:
Common Mistakes
- Forgetting the constraint when solving — the Lagrange equations alone are not enough.
- Treating all Lagrange points as minima without evaluating and comparing values.
- Dividing by zero when eliminating — always check the special cases.