# 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.

Want to thank TFD for its existence? Tell a friend about us, add a link to this page, or visit the webmaster's page for free fun content.

Link to this page: