A decomposition approach for the global minimization of biconcave functions over polytopes
Conference
·
OSTI ID:36142
A decomposition approach is proposed for minimizing bi(quasi)concave functions over polytopes. Important special cases include concave minimization, bilinear and indefinite quadratic programming for which new families of algorithms result. The approach introduces a new polyhedral partition and combines branch-and-bound techniques, outer approximation and projection of polytopes in a suitable way.
- OSTI ID:
- 36142
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
A proximal-based decomposition method for convex minimization problems
An algorithm for the minimization of an indefinite quadratic function over a box
Polytope expansion of Lie characters and applications
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35895
An algorithm for the minimization of an indefinite quadratic function over a box
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36249
Polytope expansion of Lie characters and applications
Journal Article
·
Sat Dec 14 23:00:00 EST 2013
· Journal of Mathematical Physics
·
OSTI ID:22251784