ISSN:
1573-2916
Keywords:
Generalized convex multiplicative programming
;
conical partition
;
global optimization
;
branch-and-bound.
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract We present a new method for minimizing the sum of a convex function and aproduct of k nonnegative convex functions over a convex set. This problem isreduced to a k-dimensional quasiconcave minimization problem which is solvedby a conical branch-and-bound algorithm. Comparative computational results areprovided on test problems from the literature.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1008203116882
Permalink