View source for Non-linear programming

The branch of [[Mathematical programming|mathematical programming]] concerned with the theory and methods for solving problems of optimization of non-linear functions on sets given by non-linear constraints (equalities and inequalities).

The principal difficulty in solving problems in non-linear programming is their multi-extremal nature, while the known numerical methods for solving them in the general case guarantee convergence of minimizing sequences to local extremum points only.

The best studied branch of non-linear programming is [[Convex programming|convex programming]], the problems in which are characterized by the fact that every local minimum point is a global minimum.

====References====
<table><TR><TD valign="top">[1]</TD> <TD valign="top">  W.I. Zangwill,   "Nonlinear programming: a unified approach" , Prentice-Hall  (1969)</TD></TR><TR><TD valign="top">[2]</TD> <TD valign="top">  V.G. Karmanov,   "Mathematical programming" , Moscow  (1975)  (In Russian)</TD></TR><TR><TD valign="top">[3]</TD> <TD valign="top">  E. Polak,   "Computational methods in optimization: a unified approach" , Acad. Press  (1971)</TD></TR></table>



====Comments====


====References====
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  M. Minoux,   "Mathematical programming: theory and algorithms" , Wiley  (1986)</TD></TR></table>