Strong duality for a trust-region type relaxation of the quadratic assignment problem

Linear Algebra and Its Applications

Volumn 301, Issue 1-3, 1999, Pages 121-136

  Anstreicher, Kurt ^a   Chen, Xin ^b   Wolkowicz, Henry ^c   Yuan, Ya Xiang ^d  

^a UNIVERSITY OF IOWA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

^d INSTITUTE OF COMPUTATIONAL MATHEMATICS AND SCIENTIFIC ENGINEERING COMPUTING   (China)

Author keywords

Lagrangian relaxations; Quadratic assignment problem; Quadratically constrained quadratic programs; Semidefinite programming

Indexed keywords

EID: 0033267702     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(99)00205-0     Document Type: Article

References (36)

1. A. Alfakih, S. Kruk, H. Wolkowicz, A note on geometry of semidefinite relaxations, Technical Report in progress, University of Waterloo, Waterloo, Canada, 1999.
2. F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim. 5 (1995) 13-51.
3. K.M. Anstreicher, H. Wolkowicz, On Lagrangian relaxation of quadratic matrix constraints, SIAM J. Matrix Anal. Appl. (to appear).
4. D. Bertsimas, Y. Ye, Semidefinite relaxations, multivariate normal distributions, and order statistics, in: D.-Z. Du, P.M. Pardalos (Eds.), Handbook of Combinatorial Optimization, vol. 3, Kluwer Academic Publishers, Dordrecht, 1998, pp. 1-19.
5. R. Bhatia, Perturbation Bounds for Matrix Eigenvalues: Pitman Research Notes in Mathematics Series 162, Longman, New York, 1987.
6. F. Cela, The Quadratic Assignment Problem: Theory and Algorithms, Kluwer, Massachessets, USA, 1998.
7. A. Edelman, T. Arias, S.T. Smith, The geometry of algorithms with orthogonality constraints, SIAM J. Matrix Anal. Appl. 20 (2) (1999) 303-353 (electronic).
8. G. Finke, R.E. Burkard, F. Rendl, Quadratic assignment problems, Ann. Discrete Math. 31 (1987) 61-82.
9. M. Fu, Z. Luo, Y. Ye, Approximation algorithms for quadratic programming, J. Comb. Optim. 2 (1) (1998) 29-50.
10. T. Fujie, M. Kojima, Semidefinite programming relaxation for non-convex quadratic programs, J. Global Optim. 10 (4) (1997) 367-380.
11. M.X. Goemans, D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42 (6) (1995) 1115-1145.
12. R.A. Horn, C.R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, New York, 1985.
13. S. Karisch, Non-linear approaches for quadratic assignment and graph partition problems, PhD thesis, University of Graz, Graz, Austria, 1995.
14. S.E. Karisch, F. Rendl, Semidefinite programming and graph equipartition, in: Topics in Semidefinite and Interior-Point Methods, The Fields Institute for Research in Mathematical Sciences, Communications Series, vol. 18, American Mathematical Society, Providence, RI, 1998.
15. S.E. Karisch, F. Rendl, H. Wolkowicz, Trust-regions and the quadratic assignment problem, in: Proceedings of the DIMACS Workshop on Quadratic Assignment Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, American Mathematical Society, 1994, pp. 199-219.
16. M. Kojima, L. Tuncel, Cones of matrices and successive convex relaxations of non-convex sets, Technical Report B-338, Department of Mathematical Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1998.
17. 2P, sequential quadratic constrained quadratic programming, in: Ya-xiang Yuan (Ed.), Advances in Nonlinear Programming, vol. 14 of Applied Optimization, Proceedings of Non-linear Programming Conference in Beijing in honour of Professor M.J.D. Powell, Kluwer Academic Publishers, Dordrecht, 1998, pp. 117-204.
18. Z-Q. Luo, S. Zhang, On the extension of Frank-Wolfe theorem, Technical Report, Erasmus University Rotterdam, The Netherlands, 1997.
19. J.J. Moré, D.C. Sorensen, Computing a trust-region step, SIAM J. Sci. Statist. Comput. 4 (1983) 553-572.
20. A.S. Nemirovski, C. Roos, T. Terlaky, On maximization of quadratic form over intersection of ellipsoinds with common center, Math. Programming, 1999, to appear.
21. Y.E. Nesterov, Global quadratic optimization via conic relaxation, Technical Report, CORE, Universite Catholique de Louvain, Belgium, 1998.
22. Y.E. Nesterov, Semidefinite relaxation and non-convex quadratic optimization, Optim. Meth. Softwr. 9 (1998) 141-160 (special issue Celebrating the 60th Birthday of Professor Naum Shor).
23. M.L. Overton, R.S. Womersley, Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices, Math. Programming, 62 (1993) 321-357.
24. P. Pardalos, F. Rendl, H. Wolkowicz, The quadratic assignment problem: A survey and recent developments, in: Proceedings of the DIMACS Workshop on Quadratic Assignment Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, American Mathematical Society, Providence, RI, 1994, pp. 1-41.
25. E.L. Peterson, J.G. Ecker, Geometric programming: duality in quadratic programming and lp-approximation. I, in: Proceedings of the Princeton Symposium on Mathematical Programming, Princeton University, 1967, pp. 445-480.
26. E.L. Peterson, J.G. Ecker, Geometric programming: duality in quadratic programming and lp-approximation. II. (Canonical programs), SIAM J. Appl. Math. 17 (1969) 317-340.
27. E.L. Peterson, J.G. Ecker, Geometric programming: duality in quadratic programming and lp-approximation. III, Degenerate programs, J. Math. Anal. Appl. 29 (1970) 365-383.
28. F. Rendl, Semidefinite programming and combinatorial optimization, Appl. Numer. Math. 29 (1999) 255-281.
29. F. Rendl, H. Wolkowicz, Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem, Math. Programming 53 (1992) 63-78.
30. F. Rendl, H. Wolkowicz, A semidefinite framework for trust-region subproblems with applications to large scale minimization, Math. Programming 77 (2) (1997) 273-299.
31. S.A. Santos, B.C. Sorensen, A new matrix-free algorithm for the large-scale trust-region subproblem, Technical Report TR95-20, Rice University, Houston, TX, 1995.
32. R. Stern, H. Wolkowicz, Indefinite trust-region subproblems and non-symmetric eigenvalue perturbations, SIAM J. Optim. 5 (2) (1995) 286-313.
33. T. Terlaky, On lp programming, European J. Oper. Res. 22 (1985) 70-100.
34. Y. Ye, A new complexity result on minimization of a quadratic function with a sphere constraint, in: Recent Advances in Global Optimization, pp. 19-31.
35. Y. Ye, Approximating quadratic programming with bound and quadratic constraints, Mathematical Programming 84 (1999) 219-226.
36. Q. Zhao, S.E. Karisch, F. Rendl, H. Wolkowicz, Semidefinite programming relaxations for the quadratic assignment problem, J. Combinatorial Optim. 2 (1) (1998) 71-109. URL ftp://orion.uwaterloo.ca/pub/henry/reports/qapsdp.ps.gz.