Approximating semidefinite packing programs

SIAM Journal on Optimization

Volumn 21, Issue 1, 2011, Pages 231-268

  Iyengar, G ^a   Phillips, D J ^b   Stein, C ^a  

^a Columbia University ^*  (United States)

^b The College of William and Mary   (United States)

Author keywords

Approximation algorithms; Combinatorial optimization; Nonsmooth optimization; Primal dual methods; Semidefinite programming

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; DIMENSION REDUCTION; NONSMOOTH OPTIMIZATION; PRIMAL-DUAL METHODS; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE PROGRAMMING RELAXATIONS; SPARSE PRINCIPAL COMPONENT ANALYSIS; STRUCTURAL SIMILARITY; UNFOLDING TECHNIQUES;

COMBINATORIAL OPTIMIZATION; MATHEMATICAL PROGRAMMING; PRINCIPAL COMPONENT ANALYSIS;

APPROXIMATION ALGORITHMS;

EID: 79957503711     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/090762671     Document Type: Article

References (36)

1. S. ARORA AND S. KALE, A combinatorial, primal-dual approach to semidefinite programs, in Proceedings of the 39th ACM Symposium on the Theory of Computing, 2007.
2. S. J. BENSON, Y. YE, AND X. ZHANG, Solving large-scale sparse semidefinite programs for combinatorial optimization, SIAM J. Optim., 10 (2000), pp. 443-461.
3. A. BEN-TAL AND A. NEMIROVSKI, Non-Euclidean restricted memory level method for large-scale convex optimization, Math. Program., 102 (2005), pp. 407-456. (Pubitemid 40536649)
4. U. BERGER, Brown's original fictitious play, J. Econom. Theory, 135 (2007), pp. 572-578.
5. T. CHAN, K. CHANG, AND R. RAMAN, An SDP primal-dual algorithm for approximating the Lovász-theta function, in Proceedings of the IEEE International Conference on Symposium on Information Theory, 4 (2009), pp. 2808-2812.
6. F. R. K. CHUNG, Spectral Graph Theory, CBMS Reg. Conf. Ser. Math. 92, Amer. Math. Soc., Providence, RI, 1996.
7. A. D'ASPREMONT, L. EL GHAOUI, M. I. JORDAN, AND G. R. G. LANCKRIET, A direct formulation for sparse PCA using semidefinite programming, SIAM Rev., 49 (2007), pp. 434-448. (Pubitemid 47377693)
8. A. D'ASPREMONT, Smooth optimization with approximate gradient, SIAM J. Optim., 19 (2008), pp. 1171-1183.
9. R. FREUND, Dual gauge programs, with applications to quadratic programming and the minimum-norm problem, Math. Program., 38 (1987), pp. 47-67. (Pubitemid 17637045)
10. E. GALLOPOULOS AND Y. SAAD, Efficient solution of parabolic equations by Krylov approximation methods, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 1236-1264.
11. M. X. GOEMANS AND D. P. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, 42 (1995), pp. 1115-1145.
12. N. GVOZDENOVIĆ AND M. LAURENT, The operator φ for the chromatic number of a graph, SIAM J. Optim., 19 (2008), pp. 572-591.
13. M. HOCHBRUCK AND C. LUBICH, On Krylov subspace approximations to the matrix exponential operator, SIAM J. Numer. Anal., 34 (1997), pp. 1911-1925. (Pubitemid 127463577)
14. S. HODA, A. GILPIN, J. PENA, AND T. SANDHOLM, Smoothing techniques for computing Nash equilibria of sequential games, Math. Oper. Res., 35 (2010), pp. 494-512.
15. S. Kale, personal communication, 2009.
16. D. KARGER, R. MOTWANI, AND M. SUDAN, Approximate graph coloring by semidefinite programming, J. ACM, 45 (1998), pp. 246-265. (Pubitemid 128505780)
17. P. KLEIN AND H.-I. LU, Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING, in Proceedings of the Twenty-eighth ACM Symposium on the Theory of Computing, 1996, pp. 338-347.
18. L. LOVÁSZ, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25 (1979), pp. 1-7.
19. Z. LU, R. MONTEIRO, AND M. YUAN, Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression, Math. Program., to appear.
20. ®, Mathworks, Inc., Natick, MA, http://www. mathworks.com.
21. Y. NESTEROV AND A. NEMIROVSKI, Interior-point polynomial algorithms in convex programming, SIAM Stud. Appl. Math. 13, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1994.
22. Y. NESTEROV, Smooth minimization of nonsmooth functions, Math. Program., 103 (2005), pp. 127-152.
23. Y. NESTEROV, Smoothing technique and its applications in semidefinite optimization, Math. Program., 110 (2007), pp. 245-259. (Pubitemid 46504991)
24. S. PLOTKIN, D. B. SHMOYS, AND E. TARDOS, Fast approximation algorithms for fractional packing and covering problems, Math. Oper. Res., 20 (1995), pp. 257-301.
25. R. T. ROCKAFELLAR, Convex Analysis, Princeton Math. Ser. 28, Princeton University Press, Princeton, N. J., 1970.
26. D. Steurer. personal communication, 2009.
27. J. STURM, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optim. Methods Softw., 11 (1999), pp. 625-653;
28. also available online from http://sedumi.ie.lehigh.edu/.
29. M. SZEGEDY, A note on the υ number of Lovász and the generalized Delsarte bound, in SFCS '94: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Washington, DC, 1994, IEEE Computer Society, pp. 36-39.
30. L. TREVISAN, Max cut and the smallest eigenvalue, in Proceedings of the 40th ACM Symposium on Theory of Computing, 2009; ArXiv 0806, 1978.
31. P. TSENG, On accelerated proximal gradient methods for convex-concave optimization, SIAM J. Optim., submitted.
32. J. VAN DEN ESHOF AND M. HOCHBRUCK, Preconditioning Lanczos approximations to the matrix exponential, SIAM J. Sci. Comput., 27 (2006), pp. 1438-1457. (Pubitemid 44077334)
33. K. WEINBERGER AND L. SAUL, Unsupervised learning of image manifolds by semidefinite programming, Int. J. Comput. Vision, 70 (2006), pp. 77-90. (Pubitemid 43855868)
34. L. XIAO, J. SUN, AND S. BOYD, A duality view of spectral methods for dimensionality reduction, in Proceedings of the 23rd International Conference on Machine Learning, 2006, pp. 1041-1048.
35. D. B. YUDIN AND A. S. NEMIROVSKIǏ, Informational complexity and effective methods for the solution of convex extremal problems, Ekonom. i Mat. Metody, 12 (1976), pp. 357-369.
36. H. ZOU, T. HASTIE, AND R. TIBSHIRANI, Sparse principal component analysis, J. Comput. Graph. Statist., 15 (2006), pp. 265-286. (Pubitemid 43935978)