The first order necessary KKT for the generic nonlinear programming problem is expressed. If the problem is convex, the local minimum is also the global minimum.
|
The most effective non-linear programming techniques have a strong
theoretical basis on the KKT conditions. The first order necessary KKT for the generic nonlinear programming problem is expressed. If the problem is convex, the local minimum is also the global minimum. |
|
