On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method

RAIRO Recherche Operationnelle

Volumn 30, Issue 1, 1996, Pages 31-49

  Phong, Thai Quynh ^a   Le An, Thi Hoai ^a   Tao, Pham Dinh ^a  

^a UNIVERSITÉ ET INSA DE ROUEN   (France)

Author keywords

Branch and bound; Decomposition; Global minimization; Indefinite quadratic programming

Indexed keywords

ALGORITHMS; DECOMPOSITION; MATHEMATICAL PROGRAMMING;

BRANCH AND BOUND METHOD; GLOBAL OPTIMUM; MINIMIZATION; QUADRATIC PROGRAMMING;

OPTIMIZATION;

EID: 0030371244     PISSN: 03990559     EISSN: None     Source Type: Journal    
DOI: 10.1051/ro/1996300100311     Document Type: Article

References (27)

1. LE T. H. AN, Analyse numérique des algorithmes de l'Optimisation d.c. Approches locales et globales. Codes et simulations numériques en grande dimension. Applications. Thèse de Doctorat de l'Université de Rouen, France, 1994.
2. LE T. H. AN, PHAM D. TAO and L. D. MUU, Numerical solution for Optimization over the Efficient set by d.c. optimization algorithm, To appear in Operations Research Letters.
3. J. E. FALK and R. M. SOLAND, An algorithm for separable non convex programming problems, Management Science, 1969, 15, pp. 550-569.
4. R. FLETCHER, Practical methods of Optimization (second edition), John Wiley & Sons, New York, 1991.
5. C. A. FLOUDAS and P. M. PARDALOS, A collection of test problems for constrained global optimization algorithms, In G. GOOS and J. HARTMANIS, editors, Lecture notes in Computer Science, 445, Springer-Verlag, 1987.
6. P. E. GILL, W. MURRAY and M. H. WRICHT, Practical optimization, Academic Press, 1981.
7. R. HORST, T. Q. PHONG, N. V. THOAI and J. de VRIES, On solving a d.c. programming problem by a sequence of linear programs, J. of Global Optimization, 1991, 1, pp. 183-203.
8. e edition, 1993.
9. B. KALANTARI and J. B. ROSEN, Algorithm for global minimization of linearly constrained concave quadratic functions, Mathematics of Operations Research, 1987, 12, pp. 544-561.
10. J. J. MORÉ and D. C. SORENSEN, Computing a trust region step, SIAM J. Sci. Statist. Comput., 1981, 4, pp. 553-572.
11. L. D. MUU, T. Q. PHONG and PHAM DINH TAO, Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions, Computational Optimization and Application, 1995, 4, pp. 203-216.
12. P. M. PARDALOS, J. H. GUCK and J. B. ROSEN, Global optimization of indefinite quadratic problems, Computing, 1987, 39, pp. 281-291.
13. A. T. PHILLIPS and J. B. ROSEN, A parallel algorithm for constrained concave quadratic global minimization, Mathematical Programming, 1988, 42, pp. 412-448.
14. A. T. PHILLIPS and J. B. ROSEN, A parallel algorithm for partially separable non-convex global minimization: linear constraints, Annals of Operations Research, 1990, 25, pp. 101-118.
15. T. Q. PHONG, Analyse numérique des algorithmes d'Optimisation globale. Codes et simulations numériques. Applications. Thèse de Doctorat de l' lUniversité de Rouen, France, 1994.
16. J. B. ROSEN, Minimization of linearly constrained concave function by partition of feasible domain, Math. Operations Research, 1983, 8, pp. 215-230.
17. J. B. ROSEN and P. M. PARDALOS, Global minimization of large scale constrained quadratic problems by separable programming, Mathematical Programming, 1986, 34(2), pp. 163-174.
18. PHAM D. TAO, Contribution à la théorie de normes et ses applications à l'analyse numérique. Thèse de doctorat d'état es sciences, USMG, Grenoble, France, 1981.
19. PHAM D. TAO, Convergence of subgradient method for computing the bound norm of matrices, Linear Alg. and its Appl., 1984, 62, pp. 163-182.
20. PHAM D. TAO, Algorithmes de calcul du maximum d'une forme quadratique sur la boule unité de la norme du maximum, Numerische Mathematik, 1985, 45, pp. 377-440.
21. PHAM D. TAO, Algorithms for solving a class of nonconvex optimization problems, subgradient methods, Fermat days 85. Mathematics for Optimization, Elsevier Science Publishers B. V. North-Holland, 1986.
22. PHAM D. TAO, Some new results in nonconvex nondifferentiable optimization. 6th French-German Conference on Optimization, Lambrech, Germany, 2/6-8/6 1991.
23. PHAM D. TAO and EL BERNOUSSI, Duality in d.c. (difference of convex functions) optimization, subgradient methods, Trends in Mathematical Optimization, volume 84 of International Series of Numerische Mathematik, Birkhauser, 1988.
24. PHAM D. TAO and LE T. H. AN, D. C. (difference of convex functions) optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on euclidean balls and spheres, To appear in Operations Research Letters.
25. H. TUY, Global minimization of a difference of two convex functions, Mathematical Programming Study, 1987, 30, pp. 150-182.
26. H. TUY, The complementary convex structure in global optimization, J. of Global Optimization, 1992, 2, pp. 21-40.
27. S. A. VAVASIS, Approximation algorithms for indefinite quadratic programming, Mathematical Programming, 1992, 57, pp. 279-311.