A note on reduction of quadratic and bilinear programs with equality constraints

Journal of Global Optimization

Volumn 22, Issue 1-4, 2002, Pages 39-47

  Brimberg, Jack ^a   Hansen, Pierre ^b,c   Mladenović, Nenad ^d  

^a UNIVERSITY OF PRINCE EDWARD ISLAND   (Canada)

^b HEC MONTRÉAL   (Canada)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^d MATHEMATICAL INSTITUTE   (Serbia)

Author keywords

Bilinear program; Gaussian pivoting; Quadratic program; Reduction

Indexed keywords

GLOBAL OPTIMIZATION; QUADRATIC PROGRAMMING; REDUCTION;

BILINEAR PROGRAM; COMPUTER RESULTS; EQUALITY CONSTRAINTS; GAUSSIANS; GRAPH-THEORETIC; LINEAR EQUALITY CONSTRAINTS; OPTIMIZATION PROGRAMS; QUADRATIC PROGRAMS;

GRAPH THEORY;

EID: 34247576638     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1023/A:1013838625301     Document Type: Article

References (30)

1. Al-Khayyal, F.A. (1990), Jointly Constrained Bilinear Programs and Related Problems: An Overview, Computers and Mathematics with Applications 19: 53-62.
2. Al-Khayyal, F.A., Larsen, C. and Van Voorhis, T.A. (1995), A Relaxation Method for Nonconvex Quadratically-Constrained Quadratic Programs, Journal of Global Optimization 6: 215-230.
3. Audet, C., Brimberg, J., Hansen, P. and Mladenovic, N. (2000), Pooling Problem: Alternate Formulations and Solution Methods, LesCahiers du GERAD, G-2000-23.
4. Audet, C., Hansen, P., Jaumard, B. and Savard, G. (1999), A symmetrical linear maxmin approach to disjoint bilinear programming, Mathematical Programming 85: 573-592.
5. Audet, C., Hansen, P., Jaumard, B. and Savard, G. (2000), A branch and cut algorithm for nonconvex quadratically constrained quadratic programming, Mathematical Programming 87: 131-152.
6. Ben-Tal, A., Eiger, G. and Gershovitz, V. (1994), GlobalMinimization by Reducing the Duality Gap, Mathematical Programming 63: 193-212.
7. Brimberg, J., Hansen, P. and Mladenovic, N. (2001), Reduction and Reformulation of Quadratic Programs with Equality Constraints, Les Cahiers du GERAD, G-2001-16.
8. Floudas, C.A. (2000), Deterministic Global Optimization. Theory, Methods and Applications, Kluwer, Dordrecht.
9. Floudas, C.A. and Aggarwal, A. (1990), A decomposition Strategy for Global Optimum Search in the Pooling Problem, ORSA Journal on Computing 2: 225-235.
10. Floudas, C.A., Aggarwal, A. and Ciric, A.R. (1989), Global optimum search for nonconvex NLP and MINLP problems, Computers and Chemical Engineering 13: 1117-1132.
11. Floudas, C.A. and Pardalos, P.M. (1990), A Collection of Test Problems for Constrained Global Optimization Algorithms, Springer, Berlin Heidelberg.
12. Floudas, C.A. and Visweswaran, V. (1990), A Global Optimization Algorithm (GOP) for Certain Classes of Nonconvex NLPs - I. Theory, Computers and Chemical Engineering 14: 1397-1417.
13. Floudas, C.A. and Visweswaran, V. (1993), A Primal-Relaxed Dual Optimization Approach, Journal of Optimization Theory and Applications 2: 187-225.
14. Floudas, C.A. and Visweswaran, V. (1995), Quadratic Optimization, in Handbook of Global Optimization: 217-269, Edited by Horst, R. and Pardalos, P., Kluwer, Dordrecht.
15. Geoffrion, A.M. (1972), Generalized Benders Decomposition, Journal of Optimization Theory and Applications 10: 237-260.
16. Hansen, P. and Jaumard, B. (1992), Reduction of Indefinite Quadratic Programs to Bilinear Programs, Journal of Global Optimization 2: 41-60.
17. Horst, R. and Pardalos, P.M. (eds.) (1995), Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht.
18. Horst, R., Pardalos, P.M. and Thoai, N.V. (1995), Introduction to Global Optimization, Kluwer, Dordrecht.
19. Horst, R. and Thoai, N.V. (1996), A New Algorithm for Solving the General Quadratic Programming Problem, Computational Optimization and Applications 5: 39-48.
20. Horst, R. and Tuy, H. (1996), Global Optimization: Deterministic Approaches, 3rd edition, Springer, Berlin.
21. Kojima, M. and Tuncel, L. (2000), Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization, Mathematical Programming 89: 79-111.
22. Konno, H., Thach, P.T. and Tuy, H. (1997), Optimization on Low Rank Nonconvex Structures, Kluwer Academic Publishers, Dordrecht.
23. Quesada, I. and Grossmann, I.E. (1995), A global optimization algorithm for linear fractional and bilinear programs, Journal of Global Optimization 6: 39-76.
24. Raber, U. (1998), A Simplicial Branch-and-Bound Method for Solving Nonconvex All- Quadratic Programs, Journal of Global Optimization 13: 417-432.
25. Simões, L.M. (1987), Search for the Global Optimum of Least Volume Trusses, Engineering Optimization 11: 49-67.
26. Sherali, H.D. and Alameddine, A. (1992), A new reformulation-linearization technique for bilinear programming problems, Journal of Global Optimization 2: 379-410.
27. Sherali, H.D. and Tuncbilek, C.H. (1995), A reformulation-convexification approach for solving nonconvex quadratic programming problems, Journal of Global Optimization 7: 1-31.
28. Sherali, H.D. and Tuncbilek, C.H. (1997), New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems, Operations Research Letters 21: 1-9.
29. Thoai, N.V. (2000), Duality bound method for the general quadratic programming problem with quadratic constraints, Journal of Optimization Theory and Applications 107: 331-354.
30. Wolsey, L.A. (1981), A Resource Decomposition Algorithm for General Mathematical Programs, Mathematical Programming Study 14: 244-257.