Sparse sums of positive semidefinite matrices

ACM Transactions on Algorithms

Volumn 12, Issue 1, 2015, Pages

  De Carli Silva, Marcel K ^a   Harvey, Nicholas J A ^b   Sato, Cristiane M ^c  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c UNIVERSIDADE FEDERAL DO ABC   (Brazil)

Author keywords

Derandomization; Laplacian matrix; Positive semidefinite matrices; Randomized algorithms; Spectral sparsifiers

Indexed keywords

ALGORITHMS; APPLICATION PROGRAMS; GRAPH THEORY; POLYNOMIAL APPROXIMATION;

DERANDOMIZATION; LAPLACIAN MATRICES; POSITIVE SEMIDEFINITE MATRICES; RANDOMIZED ALGORITHMS; SPECTRAL SPARSIFIERS;

MATRIX ALGEBRA;

EID: 84954315883     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/2746241     Document Type: Article

References (43)

1. Rudolf Ahlswede and Andreas Winter. 2002. Strong converse for identification via quantum channels. IEEE Transactions on Information Theory 48, 3, 569-579.
2. Ingo Althöfer. 1994. On sparse approximations to randomized strategies and convex combinations. Linear Algebra and Applications 199, 339-355.
3. Sanjeev Arora and Satyen Kale. 2007. A combinatorial, primal-dual approach to semidefinite programs. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC'07). ACM, New York, NY, 227-236. DOI:http://dx.doi.org/10.1145/1250790.1250823
4. Joshua Batson, Daniel A. Spielman, and Nikhil Srivastava. 2012. Twice-Ramanujan sparsifiers. SIAM Journal on Computing 41, 6, 1704-1721. DOI:http://dx.doi.org/10.1137/090772873
5. Joshua Batson, Daniel A. Spielman, Nikhil Srivastava, and Shang-Hua Teng. 2013. Spectral sparsification of graphs: Theory and algorithms. Communications of the ACM 56, 8, 87-94. DOI:http://dx.doi.org/10.1145/2492007.2492029
6. 2) time. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC'96). ACM, New York, NY, 47-55. DOI:http://dx. doi.org/10.1145/237814.237827
7. András A. Benczúr and David R. Karger. 2002. Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs. Available at http://arxiv.org/abs/cs/0207078
8. Christos Boutsidis, Petros Drineas, and Malik Magdon-Ismail. 2011. Near-optimal column-based matrix reconstruction. In Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS'11). IEEE, Los Alamitos, CA, 305-314. DOI:http://dx.doi.org/10.1109/FOCS.2011.21
9. Marcel K. de Carli Silva and Levent Tunçel. 2013. Optimization problems over unit-distance representations of graphs. Electronic Journal of Combinatorics 20, 1, Research Paper No. 43. http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i1p43.
10. Marcel K. de Carli Silva, Nicholas J. A. Harvey, and Cristiane M. Sato. 2011. Sparse Sums of Positive Semidefinite Matrices. Available at http://arxiv.org/abs/1107.0088v1
11. Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, and Debmalya Panigrahi. 2011. A general framework for graph sparsification. In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC'11). ACM, New York, NY, 71-80. DOI:http://dx.doi.org/10.1145/1993636.1993647
12. Wai Shing Fung and Nicholas J. A. Harvey. 2010. Graph Sparsification by Edge-Connectivity and Random Spanning Trees. Available at http://arxiv.org/abs/1005.0265v1
13. Ashish Goel, Michael Kapralov, and Sanjeev Khanna. 2010. Graph Sparsification via Refinement Sampling. Available at http://arxiv.org/abs/1004.4915
14. William W. Hager. 1989. Updating the inverse of a matrix. SIAM Review 31, 2, 221-239.
15. Ramesh Hariharan and Debmalya Panigrahi. 2010a. A General Framework for Graph Sparsification. Available at http://arxiv.org/abs/1004.4080
16. Ramesh Hariharan and Debmalya Panigrahi. 2010b. A Linear-Time Algorithm for Sparsification of Unweighted Graphs. Available at http://arxiv.org/abs/1005.0670
17. Thomas Hofmeister and Hanno Lefmann. 1996. Computing sparse approximations deterministically. Linear Algebra and Its Applications 240, 9-19.
18. Roger A. Horn and Charles R. Johnson. 1990. Matrix Analysis. Cambridge University Press, Cambridge, MA.
19. Garud Iyengar, David J. Phillips, and Clifford Stein. 2005. Approximation algorithms for semidefinite packing problems with applications to maxcut and graph coloring. In Proceedings of the 11th International Conference on Integer Programming and Combinatorial Optimization (IPCO'05). 152-166. DOI:http://dx.doi.org/10.1007/11496915-12
20. Garud Iyengar, David J. Phillips, and Clifford Stein. 2011. Approximating semidefinite packing programs. SIAM Journal on Optimization 21, 1, 231-268. DOI:http://dx.doi.org/10.1137/090762671
21. Rahul Jain and Penghui Yao. 2011. A parallel approximation algorithm for positive semidefinite programming. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'11). IEEE, Los Alamitos, CA, 463-471. http://dx.doi.org/10.1109/FOCS.2011.25
22. Satyen Kale. 2007. Efficient Algorithms Using the Multiplicative Weights Update Method. Ph.D. Dissertation. Princeton University, Princeton, NJ.
23. Ioannis Koutis, Alex Levin, and Richard Peng. 2012. Improved spectral sparsification and numerical algorithms for SDD matrices. In Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS'12). 266-277. DOI:http://dx.doi.org/10.4230/LIPIcs.STACS.2012.266
24. Ioannis Koutis, Gary L. Miller, and Richard Peng. 2010. Approaching optimality for solving SDD systems. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS'10). IEEE, Los Alamitos, CA, 235-244. DOI:http://dx.doi.org/10.1109/FOCS.2010.29
25. Richard J. Lipton and Neal E. Young. 1994. Simple strategies for large zero-sum games with applications to complexity theory. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC'94). ACM, New York, NY, 734-740. DOI:http://dx.doi.org/10.1145/195058.195447
26. Laszlo Lovász. 2001. Semidefinite Programs and Combinatorial Optimization. Available at https://www.cs. elte.hu/lovasz/semidef.ps.
27. Robert J. McEliece, Eugene R. Rodemich, and Howard C. Rumsey, Jr. 1978. The Lovász bound and some generalizations. Journal of Combinatorics, Information, and System Sciences 3, 3, 134-152.
28. Ilan Newman and Yuri Rabinovich. 2010. Finite Volume Spaces and Sparsification. Available at http://arxiv.org/abs/1002.3541
29. Prabhakar Raghavan. 1988. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences 37, 130-143.
30. Juan A. Rodríguez. 2002. On the Laplacian eigenvalues and metric parameters of hypergraphs. Linear Multilinear Algebra 50, 1, 1-14. DOI:http://dx.doi.org/10.1080/03081080290011692
31. Mark Rudelson. 1996. Random Vectors in the Isotropic Position. Technical Report MSRI preprint #1996-060. Mathematical Sciences Research Institute, Berkeley, CA.
32. Mark Rudelson. 1999. Random vectors in the isotropic position. Journal of Functional Analysis 164, 1, 60-72.
33. p for even p. Proceedings of the American Mathematical Society 139, 12, 4419-4421. DOI:http://dx.doi.org/10.1090/S0002-9939-2011-10863-3
34. Alexander Schrijver. 1979. A comparison of the Delsarte and Lovász bounds. IEEE Transactions on Information Theory 25, 4, 425-429. DOI:http://dx.doi.org/10.1109/TIT.1979.1056072
35. Alexander Schrijver. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Vol. B: Matroids, Trees, Stable Sets. Springer-Verlag, Berlin, Germany.
36. Daniel A. Spielman and Nikhil Srivastava. 2008. Graph sparsification by effective resistances. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC'08). ACM, New York, NY, 563-568. DOI:http://dx.doi.org/10.1145/1374376.1374456
37. Daniel A. Spielman and Nikhil Srivastava. 2012. An elementary proof of the restricted invertibility theorem. Israel Journal of Mathematics 190, 83-91. DOI:http://dx.doi.org/10.1007/s11856-011-0194-2
38. Daniel A. Spielman and Shang-Hua Teng. 2004. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC'04). ACM, New York, NY, 81-90.
39. Nikhil Srivastava. 2012. On contact points of convex bodies. In Geometric Aspects of Functional Analysis. Lecture Notes in Mathematics, vol. 2050. Springer, Heidelberg, Germany, 393-412. DOI:http://dx.doi.org/10.1007/978-3-642-29849-3-25
40. Joel Tropp. 2012. User-Friendly Tools for Random Matrices: An Introduction. Manuscript.
41. Avi Wigderson and David Xiao. 2008. Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators and applications. Theory of Computing 4, 3, 53-76.
42. Pierre Youssef. 2013. Estimating the covariance of random matrices. Electronic Journal of Probability 18, 107, 1-26. DOI:http://dx.doi.org/10.1214/EJP.v18-2579
43. Anastasios Zouzias. 2012. A matrix hyperbolic cosine algorithm and applications. In Automata, Languages, and Programming. Part I. Lecture Notes in Computer Science, Vol. 7391. Springer, Heidelberg, Germany, 846-858.