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.
References in periodicals archive ?
A Bisection Method for Convex Programming Problem Solution based on Projection Neural Network.
As we know, convex programming is a special kind of non-linear programming.
Hence, if Equation (13) is a convex programming problem, Models 1-3 are convex programming problems.
Hence, the problem of Equation (13) is a convex programming problem.
We emphasize the theories of Nesterov and Nemirovsky [18] which use this class of functions for developing linear and convex quadratic programs with convex quadratic constraints, and Udriste's works [26], [28] which develop barrier methods for smooth convex programming on Riemannian manifolds.
Guler: Hyperbolic polynomials and interior point methods for convex programming, Math.