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.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
Copyright © 2003-2025 Farlex, Inc
Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.