@article{RO_1996__30_1_31_0, author = {Tha{\"\i} Quynh Phong and Le Thi Hoai An and Pham Dinh Tao}, title = {On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {31--49}, publisher = {EDP-Sciences}, volume = {30}, number = {1}, year = {1996}, mrnumber = {1399983}, zbl = {0857.90098}, language = {en}, url = {http://www.numdam.org/item/RO_1996__30_1_31_0/} }
TY - JOUR AU - Thaï Quynh Phong AU - Le Thi Hoai An AU - Pham Dinh Tao TI - On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 1996 SP - 31 EP - 49 VL - 30 IS - 1 PB - EDP-Sciences UR - http://www.numdam.org/item/RO_1996__30_1_31_0/ LA - en ID - RO_1996__30_1_31_0 ER -
%0 Journal Article %A Thaï Quynh Phong %A Le Thi Hoai An %A Pham Dinh Tao %T On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method %J RAIRO - Operations Research - Recherche Opérationnelle %D 1996 %P 31-49 %V 30 %N 1 %I EDP-Sciences %U http://www.numdam.org/item/RO_1996__30_1_31_0/ %G en %F RO_1996__30_1_31_0
Thaï Quynh Phong; Le Thi Hoai An; Pham Dinh Tao. On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method. RAIRO - Operations Research - Recherche Opérationnelle, Tome 30 (1996) no. 1, pp. 31-49. http://www.numdam.org/item/RO_1996__30_1_31_0/
1. 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. Numerical solution for Optimization over the Efficient set by d.c. optimization algorithm, To appear in Opérations Research Letters. | Zbl
, and ,3. An algorithm for separable non convex programming problems, Management Science, 1969, 75, pp. 550-569. | MR | Zbl
and ,4. Practical methods of Optimization (second edition), John Wiley & Sons, New York, 1991. | MR | Zbl
,5. 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. | Zbl
, ,6. Practical optimization, Academic Press, 1981. | MR | Zbl
, and ,7. On solving a d.c. programming problem by a sequence of linear programs, 7. of Global Optimization, 1991, I, pp. 183-203. | MR | Zbl
, , and ,8. Global Optimization: Deterministic Approaches, Springer-Verlag, Berlin, New York, 2e edition, 1993. | MR | Zbl
and ,9. Algorithm for global minimization of linearly constrained concave quadratic functions, Mathematics of Opérations Research, 1987 72, pp. 544-561. | MR | Zbl
and ,10. Computing a trust region step, SIAM J. Sel Statist. Comput., 1981. 4, pp.553-572. | MR | Zbl
and ,11. 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. | MR | Zbl
, and ,12. Global optimization of indefinite quadratic problems, Computing, 1987, 39, pp. 281-291. | MR | Zbl
, and ,13. A parallel algorithm forconstrained concave quadratic global minimization, Mathematical Programming, 1988, 42, pp.412-448. | MR | Zbl
and ,14. A parallel algorithm forpartially separable non-convex global minimization: linear constraints, Annals of Operations Research, 1990, 25, pp. 101-118. | MR | Zbl
and ,15. Analyse numérique des algorithmes d'Optimisation globale. Codes et simulations numériques. Applications. Thèse de Doctorat de l'Université de Rouen, France, 1994.
,16. Minimization of linearly constrained concave function by partition of feasible domain, Math. Operations Research, 1983, 8, pp. 215-230. | MR | Zbl
,17. Global minimization of large scale constrained quadratic problems by separable programming, Mathematical Programming, 1986, 34(2), PP. 163-174. | MR | Zbl
and ,18. 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. Convergence of subgradient method for Computing the bound norm of matrices, Linear Alg. and its Appl., 1984, 62, pp. 163-182. | MR | Zbl
,20. 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. | MR | Zbl
,21. 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. | Zbl
,22. Some new results in nonconvex nondifferentiable optimization. 6th French-German Conference on Optimization, Lambrech, Germany, 2/6-8/6 1991.
,23. 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. | MR | Zbl
and ,24. D. C. (difference of convex functions) optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on euclidean balls and sphères, To appear in Opérations Research Letters. | Zbl
and ,25. Global minimization of a difference of two convex functions, Mathematical Programming Study, 1987, 30, pp. 150-182. | MR | Zbl
,26. The complementary convex structure in global optimization, J. of Global Optimization, 1992, 2, pp.21-40. | MR | Zbl
,27. Approximation algorithms for indefinite quadratic programming, Mathematical Programming, 1992, 57, pp. 279-311. | MR | Zbl
,