Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems

Operations Research Letters

Volumn 17, Issue 5, 1995, Pages 215-220

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

^a Avenue de l Université 76801 Saint Etienne du Rouvray   (France)

Author keywords

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

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; FUNCTIONS; OPERATIONS RESEARCH; PROBLEM SOLVING;

DECOMPOSITION BRANCH AND BOUND METHOD; GLOBAL MINIMIZATION; INDEFINITE QUADRATIC PROGRAMMING;

MATHEMATICAL PROGRAMMING;

EID: 0029313349     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6377(95)00014-B     Document Type: Article

References (13)

1. A collection of test problems for constrained global optimization algorithms
2. A primal-relaxed dual global optimization approach: Theory
3. On solving a d.c. programming problem by a sequence of linear programs
4. Global optimization of indefinite quadratic problems
5. Constrained global optimization: Algorithms and applications
6. A parallel algorithm for partially separable non-convex global minimization: Linear constraints
7. Convergence of subgradient method for computing the bound norm of matrices
8. Algorithmes de calcul du maximum d'une forme quadratique sur la boule unité de la norme du maximum
9. Algorithms for solving a class of nonconvex optimization problems. sub-gradient methods
10. Duality in d.c. (difference of convex functions) optimization. subgradient methods
11. New properties and computational improvement of the GOP algorithms with quadratic objective functions and constraints