Some articles on convex programming, convex, programming:
... Convex programming studies the case when the objective function is convex (minimization) or concave (maximization) and the constraint set is convex ... This can be viewed as a particular case of nonlinear programming or as generalization of linear or convex quadratic programming ... Linear programming (LP), a type of convex programming, studies the case in which the objective function f is linear and the set of constraints is specified using only linear equalities and inequalities ...
Famous quotes containing the word programming:
“If there is a price to pay for the privilege of spending the early years of child rearing in the drivers seat, it is our reluctance, our inability, to tolerate being demoted to the backseat. Spurred by our success in programming our children during the preschool years, we may find it difficult to forgo in later states the level of control that once afforded us so much satisfaction.”
—Melinda M. Marshall (20th century)