Instructor: Hasan A. Poonawala
Mechanical and Aerospace Engineering
University of Kentucky, Lexington, KY, USA
Topics:
Solutions
Necessary and Sufficient Conditions
Overview of Algorithms
Suppose we have data in the form of pairs
We believe that the model is of the form
A standard approach is to find the values of , by solving where
This is a nonlinear least-square problem.
Global minimizer
A point is a global minimizer if for all .
Local minimizer
A point is a local minimizer if there is a neighborhood of where for all , where a neighbor of is an open set containing .
Strict local minimizer
A point is a strict local minimizer if there is a neighborhood of where for all with .
Taylor’s Theorem
Suppose that is continuously differentiable and that . Then we have that for some . Moreover, if is twice continuously differentiable, we have that and that for some .
FONC
If is a local minimizer and is continuously differentiable in an open neighborhood of , then .
Notice that this is not the same as is a local minimizer
Stationary point
A point is a stationary point if it satisfies
SONC
If is a local minimizer of and exists and is continuous in an open neighborhood of , then and is positive semidefinite.
SONC
Suppose that is continuous in a neighborhood of and that and is positive definite. Then is a strict local minimizer of .
There is no first-order sufficient condition for when it is only differentiable
However, when is also convex, there is:
FOSC for convex
When is convex, any local minimizer is a global minimizer of . If in addition is differentiable, then any stationary point is a global minimizer of .
Systems Optimization I • Hasan Poonawala