Nonlinear programming is the optimization of an objective function subject to equality and inequality constraints, where the objective or at least one constraint is nonlinear. A standard problem has the form
 |
Necessary conditions for a constrained local optimum are expressed by the Kuhn-Tucker theorem under suitable constraint qualifications. For a problem in convex optimization theory, every local minimum is a global minimum.
