On non-approximability for quadratic programs

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 206-215

  Arora, Sanjeev ^a   Berger, Eli ^b   Hazan, Elad ^a   Kindler, Guy ^b   Safra, Muli ^b  

^a Princeton University   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY MATRIX; DIAGONAL ELEMENTS; GROTHENDIECK CONSTANTS; GROTHENDIECK INEQUALITIES;

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INTEGRATION; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING;

QUADRATIC PROGRAMMING;

EID: 33748614322     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.57     Document Type: Conference Paper

References (21)

1. [ALM+98] S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. Journal of the ACM, 45:501-555, 1998.
2. [AMMN] Noga Alon, Konstantin Makarychev, Yury Makarychev, and Assaf Naor. Quadratic forms on graphs. To appear STOC 2005.
3. [AN04] Noga Alon and Assaf Naor. Approximating the cut-norm via grothendieck's inequality. In STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 72-80, New York, NY, USA, 2004. ACM Press.
4. [AS98] S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45:70-122, 1998.
5. [BBC] Nikhil Bansal, Avrim Blum, and Shuchi Chawla. Correlation clustering. Mach. Learn., 56(1-3):89-113.
6. [Bou02] J. Bourgain. On the distribution of the fourier spectrum of boolean functions. Israel Journal of Mathematics, 131:269-276, 2002.
7. [CKK+ 05] Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. In manuscript, 2005.
8. [CW04] Moses Charikar and Anthony Wirth. Maximizing quadratic programs: Extending grothendieck's inequality. In FOCS '04: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOGS'04), pages 54-60, Washington, DC, USA, 2004. IEEE Computer Society.
9. [FK99] A. M. Frieze and R. Kannan. Quick approximation to matrices and applications. Combinatorica, 19:175-200, 1999.
10. [Kho] Subhash Khot. personal communications, march 2005.
11. [Kho02] Subhash Khot. On the power of unique 2-prover 1-round games. In STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pages 767-775, New York, NY, USA, 2002. ACM Press.
12. [KKMO] Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan ODonnell. Optimal inapproximability results for max-cut and other 2-variable csps? In FOCS 2004.
13. [KO] S. Khot and R. O'Donnell. personal communications, march 2005.
14. [KS03] B. S. Kashin and S. J. Szarek. On the gram matrices of systems of uniformly bounded functions. Proceedings of the Steklov Institute of Mathematics, 243:227-233, 2003.
15. 1. to appear FOCS 2005.
16. [Meg01] A. Megretski. Relaxation of quadratic programs in operator theory and system analysis. Systems, Approximation, Singular Integral Operators, and Related Topics (Bordeaux, 2000), (3):365-392, 2001.
17. [Nes98] Y. Nesterov. Global quadratic optimization via conic relaxation. Working paper CORE, 1998.
18. [NRT99] A. Nemirovski, C. Roos, and T. Terlaky. On maximization of quadratic form over intersection of ellipsoids with common center. Mathematical Programming, 86(3):463-473, 1999.
19. [O'D04] R. O'Donnell. Phd thesis. In MIT, 2004.
20. [Raz98] R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, June 1998.
21. [Tal03] Michel Talagrand. Spin Glasses: a Challenge to Mathematicians, volume 46 of Ergbnisse der Mathematik und ihrer Grenzgebiete. New York, 2003.