On semidefinite bounds for maximization of a non-convex quadratic objective over the ℓ1 unit ball

RAIRO - Operations Research

Volumn 40, Issue 3, 2006, Pages 253-265

  Pinar, Mustafa Ç ^a   Teboulle, Marc ^b  

^a BILKENT UNIVERSITY   (Turkey)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Duality; L1 norm constraint; Non convex quadratic optimization; Semidefinite programming relaxation

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; OPTIMIZATION; PROBLEM SOLVING;

DUALITIES; NON CONVEX QUADRATIC OPTIMIZATION; QUADRATIC OBJECTIVES; SEMIDEFINITE PROGRAMMING RELAXATION;

OPERATIONS RESEARCH;

EID: 33751440533     PISSN: 03990559     EISSN: 28047303     Source Type: Journal    
DOI: 10.1051/ro:2006023     Document Type: Article

References (18)

1. M.X. Goemans and D.P. Williamson, Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems using Semidefinite Programming. J. ACM 42 (1995) 1115-1145.
2. J.-B. Hiriart-Urruty, Conditions for Global Optimality, in Handbook for Global Optimization. Kluwer Academic Publishers, Dordrecht, Holland (1999) 1-26.
3. J.-B. Hiriart-Urruty, Conditions for Global Optimality 2. J. Global Optim. 13 (1998) 349-367.
4. J.-B. Hiriart-Urruty, Global Optimality Conditions in Maximizing a Convex Quadratic Function under Convex Quadratic Constraints. J. Global Optim. 21 (2001) 445-455.
5. R.A. Horn and C.R. Johnson, Matrix Analysis. Cambridge University Press, Cambridge (1985).
6. V. Jeyakumar, A.M. Rubinov and Z.Y. Wu, Non-convex Quadratic Minimization Problems with Quadratic Constraints: Global Optimality Conditions. Technical Report AMR05/19, University of South Wales, School of Mathematics (2005).
7. V. Jeyakumar, A.M. Rubinov and Z.Y. Wu, Sufficient Global Optimality Conditions for Non-convex Quadratic Minimization Problems with Box Constraints. Technical Report AMR05/20, University of South Wales, School of Mathematics (2005).
8. J.-B. Lasserre, Global Optimization with Polynomials and the problem of moments. SIAM J. Optim. 11 (2001) 796-817.
9. J.-B. Lasserre, GloptiPoly: Global Optimization over Polynomials with Matlab and SeDuMi. ACM Trans. Math. Software 29 (2003) 165-194.
10. M. Laurent, A comparison of the Sherali-Adams, Lovasz-Schrijver and Lasserre relaxations for 0-1 programming. Math. Oper. Res. 28 (2003) 470-496.
11. L. Lovasz and A. Schrijver, Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1 (1991) 166-190.
12. Y. Nesterov, Semidefinite Relaxation and Non-convex Quadratic Optimization. Optim. Methods Softw. 12 (1997) 1-20.
13. Y. Nesterov, Global Quadratic Optimization via Conic Relaxation, in Handbook of Semidefinite Programming, edited by H. Wolkowicz, R. Saigal and L. Vandenberghe. Kluwer Academic Publishers, Boston (2000) 363-384.
14. R.T. Rockafellar, Convex Analysis. Princeton University Press, Princeton, NJ (1970).
15. N.Z. Shor, On a bounding method for quadratic extremal problems with 0-1 variables. Kibernetika 2 (1985) 48-50.
16. H. Wolkowicz, R. Saigal and L. Vandenberghe (Editors), Handbook of semidefinite programming: Theory, Algorithms, and Applications. Kluwer Academic Publishers, Boston, MA (2000).
17. Y. Ye, Approximating Quadratic Programming with Bound and Quadratic Constraints. Math. Program. 84 (1999) 219-226.
18. S. Zhang, Quadratic Maximization and Semidefinite Relaxation. Math. Program. 87 (2000) 453-465.