Nonlinear programming is the optimization of a nonlinear objective function, possibly subject to nonlinear equality and inequality constraints.
A standard problem has the form
Necessary conditions for a constrained local optimum are expressed by the Kuhn-Tucker theorem under suitable constraint qualifications. Convex nonlinear programs have
the additional property that every local minimum is a global
minimum.
