convex programming


convex programming

[′kän‚veks ′prō‚gram·iŋ] (mathematics) Nonlinear programming in which both the function to be maximized or minimized and the constraints are appropriately chosen convex or concave functions of the independent variables.