Decomposition approach for the global minimization of biconcave functions over polytopes

Journal of Optimization Theory and Applications

Volumn 88, Issue 3, 1996, Pages 561-583

  Horst, R ^a   Thoai, N V ^a,b  

^a UNIVERSITY OF TRIER   (Germany)

^b INSTITUTE OF MATHEMATICS   (Viet Nam)

Author keywords

Biconcave programming; Bilinear and quadratic programming; Branch and bound algorithms; Concave minimization; Global optimization; Outer approximations

Indexed keywords

APPROXIMATION ALGORITHMS; BRANCH AND BOUND METHOD; QUADRATIC PROGRAMMING; TOPOLOGY;

BICONCAVE PROGRAMMING; BILINEAR AND QUADRATIC PROGRAMMING; BRANCH-AND-BOUND ALGORITHMS; CONCAVE MINIMIZATION; DECOMPOSITION APPROACH; GLOBAL MINIMIZATION; GLOBAL OPTIMISATION; INDEFINITE QUADRATIC PROGRAMMING; OUTER APPROXIMATION; POLYTOPES;

GLOBAL OPTIMIZATION;

EID: 0030556719     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02192199     Document Type: Article

References (16)

1. AL-KHAYYAL, F. A., Constrained Bilinear Programming and Jointly Related Problems, Report J-83-3, Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia, 1983.
2. HORST, R., and TUY, H., On the Convergence of Global Methods in Multiextremal Optimization, Journal of Optimization Theory and Applications, Vol. 54, pp. 253-271, 1987.
3. HORST, R., and TUY, H., Global Optimization: Deterministic Approaches, 2nd Revised Edition, Springer, Berlin, Germany, 1993.
4. THOAI, N. V., and TUY, H., Convergent Algorithms for Minimizing a Concave Function, Mathematics of Operations Research, Vol. 5, pp. 556-566, 1980.
5. HORST, R., and TUY, H., Convergence and Restart in Branch-and-Bound Algorithms for Global Optimization: Application to Concave Minimization and DC-Optimization Problems, Mathematical Programming, Vol. 41, pp. 161-183, 1988.
6. HORST, R., An Algorithm for Nonconvex Programming Problems, Mathematical Programming, Vol. 10, pp. 312-321, 1976.
7. BENSON, H. P., Concave Minimization, Handbook of Global Optimization, Edited by R. Horst and P. Pardalos, Kluwer Academic Publishers, Dordrecht, Netherlands, pp. 43-148, 1995.
8. HORST, R., THOAI, N. V., and DE VRIES, J., On Finding New Vertices and Redundant Constraints in Cutting-Plane Algorithms for Global Optimization, Operations Research Letters, Vol. 7, pp. 85-90, 1988.
9. CHEN, P. C., HANSEN, P., and JAUMARD, B., On-Line and Off-Line Vertex Enumeration by Adjacency Lists, Operations Research Letters, Vol. 10, pp. 403-409, 1991.
10. TUY, H., Concave Minimization under Linear Constraints with Special Structure, Optimization, Vol. 16, pp. 335-352, 1985.
11. HORST, R., and THOAI, N. V., Constraints Decomposition Algorithms in Global Optimization, Journal of Global Optimization, Vol. 5, pp. 333-348, 1994.
12. THOAI, N. V., A Global Optimization Approach for Solving Convex Multiplicative Programming Problems, Journal of Global Optimization, Vol. 1, pp. 341-357, 1991.
13. THOAI, N. V., Canonical DC-Programming Techniques for Solving a Convex Program with an Additional Constraint of Multiplicative Type, Computing, Vol. 50, pp. 241-253, 1993.
14. HORST, R., and THOAI, N. V., A New Algorithm for Solving the General Quadratic Problem, Computational Optimization and Applications. Vol. 5, pp. 39-48, 1990.
15. HORST, R., and THOAI, N. V., Modification, Implementation, and Comparison of Three Algorithms for Globally Solving Linearly-Constrained Concave Minimization Problems, Computing, Vol. 42, pp. 271-289, 1989.
16. HORST, R., THOAI, N. V., and BENSON, H. P., Concave Minimization via Conical Partitions and Polyhedral Outer Approximation, Mathematical Programming, Vol. 50, pp. 259-274, 1991.