Practical Minimization Method
When the domain is compact and is , a systematic method for finding the global minimum combines Fermat's theorem with boundary analysis:
Step 1: Find all interior critical points by solving in the interior of . Step 2: Find all critical points on the boundary (using Lagrange multipliers or parameterization of the boundary). Step 3: Evaluate at all critical points found in Steps 1 and 2. Step 4: The global minimum is the smallest value among all these candidates.
This method works because the EVT guarantees a minimum exists, and by Fermat's theorem, every interior minimum is a critical point. The boundary requires separate analysis since at boundary minima is possible.
Formal View
Why This Matters
This systematic method is the workhorse for constrained optimization in engineering, economics, and data science.
- Quadratic programming: minimize a quadratic objective over a box or polytope
- Portfolio optimization with investment constraints (budget, bounds on weights)
- Control theory: optimal control on bounded input/state spaces
Quiz
When minimizing over a compact domain, which points must be considered as candidates?
On a compact domain, every critical point in the interior is the global minimum.
Common Mistakes
- Checking only interior critical points and ignoring the boundary.
- Forgetting to evaluate at all candidates — just finding the critical points is not enough.
- Not applying Lagrange multipliers correctly for boundary analysis when the boundary is curved.