Papers
Topics
Authors
Recent
Search
2000 character limit reached

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices

Published 31 Oct 2024 in math.OC | (2410.23849v1)

Abstract: Semidefinite programming (SDP) problems are challenging to solve because of their high dimensionality. However, solving sparse SDP problems with small tree-width are known to be relatively easier because: (1) they can be decomposed into smaller multi-block SDP problems through chordal conversion; (2) they have low-rank optimal solutions. In this paper, we study more general SDP problems whose coefficient matrices have sparse plus low-rank (SPLR) structure. We develop a unified framework to convert such problems into sparse SDP problems with bounded tree-width. Based on this, we derive rank bounds for SDP problems with SPLR structure, which are tight in the worst case.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (42)
  1. Positive semidefinite matrices with a given sparsity pattern. Linear algebra and its applications, 107:101–149, 1988.
  2. A. I. Barvinok. Problems of distance geometry and convex properties of quadratic maps. Discrete & Computational Geometry, 13:189–202, 1995.
  3. J. R. Blair and B. Peyton. An introduction to chordal graphs and clique trees. In Graph Theory and Sparse Matrix Computation, pages 1–29. Springer, 1993.
  4. The non-convex Burer-Monteiro approach works on smooth semidefinite programs. Advances in Neural Information Processing Systems, 29, 2016.
  5. S. Burer. On the copositive representation of binary and continuous nonconvex quadratic programs. Mathematical Programming, 120(2):479–495, 2009.
  6. S. Burer and R. D. Monteiro. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Mathematical Programming, 95(2):329–357, 2003.
  7. S. Burer and R. D. Monteiro. Local minima and convergence in low-rank semidefinite programming. Mathematical Programming, 103(3):427–444, 2005.
  8. D. Cifuentes. On the Burer–Monteiro method for general semidefinite programs. Optimization Letters, 15(6):2299–2309, 2021.
  9. J. Dancis. Positive semidefinite completions of partial Hermitian matrices. Linear Algebra and its Applications, 175:97–114, 1992.
  10. R. Diestel. Graph theory 3rd ed. Graduate Texts in Mathematics, 173(33):12, 2005.
  11. A note on the width of sparse random graphs. Journal of Graph Theory, 106(2):273–295, 2024.
  12. Convex relaxation for optimal distributed control problems. IEEE Transactions on Automatic Control, 62(1):206–221, 2016.
  13. S. Friedland and R. Loewy. Subspaces of symmetric matrices containing matrices with a multiple first eigenvalue. Pacific Journal of Mathematics, 62(2):389–399, 1976.
  14. Exploiting sparsity in semidefinite programming via matrix completion i: General framework. SIAM Journal on Optimization, 11(3):647–674, 2001.
  15. Positive definite completions of partial Hermitian matrices. Linear algebra and its applications, 58:109–124, 1984.
  16. A semidefinite programming approach to the quadratic knapsack problem. Journal of Combinatorial Optimization, 4:197–215, 2000.
  17. X. Jiang. Minimum rank positive semidefinite matrix completion with chordal sparsity pattern. University of California, Los Angeles, 2017.
  18. Fast and certifiable trajectory optimization. arXiv preprint arXiv:2406.05846, 2024.
  19. M. Laurent and A. Varvitsiotis. A new graph parameter related to bounded rank positive semidefinite matrix completions. Mathematical Programming, 145(1-2):291–325, 2014.
  20. Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition. arXiv preprint arXiv:2204.14067, 2022.
  21. L. Lovász. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, 25(1):1–7, 1979.
  22. Rank-2 matrix solution for semidefinite relaxations of arbitrary polynomial optimization problems. Constraints, 21:25, 2014.
  23. Finding low-rank solutions of sparse linear matrix inequalities using convex optimization. SIAM Journal on Optimization, 27(2):725–758, 2017.
  24. A low-rank augmented lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach. arXiv preprint arXiv:2401.12490, 2024.
  25. Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results. Mathematical Programming, 95:303–327, 2003.
  26. G. Pataki. On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Mathematics of Operations Research, 23(2):339–358, 1998.
  27. F. Rendl. Semidefinite programming and combinatorial optimization. Applied Numerical Mathematics, 29(3):255–281, 1999.
  28. N. Robertson and P. D. Seymour. Graph minors. I. excluding a forest. Journal of Combinatorial Theory, Series B, 35(1):39–61, 1983.
  29. J. F. Sturm. Using sedumi 1.02, a Matlab toolbox for optimization over symmetric cones. Optimization Methods and Software, 11(1-4):625–653, 1999.
  30. SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0). Optimization Methods and Software, 35(1):87–115, 2020.
  31. T. Tang and K.-C. Toh. A feasible method for general convex low-rank SDP problems. SIAM Journal on Optimization, 34(3):2169–2200, 2024.
  32. T. Tang and K.-C. Toh. A feasible method for solving an SDP relaxation of the quadratic knapsack problem. Mathematics of Operations Research, 49(1):19–39, 2024.
  33. T. Tang and K.-C. Toh. Solving graph equipartition SDPs on an algebraic variety. Mathematical Programming, 204(1):299–347, 2024.
  34. SDPT3—a Matlab software package for semidefinite programming, version 1.3. Optimization Methods and Software, 11(1-4):545–581, 1999.
  35. Solving semidefinite-quadratic-linear programs using SDPT3. Mathematical Programming, 95(2):189–217, 2003.
  36. Chordal graphs and semidefinite optimization. Foundations and Trends® in Optimization, 1(4):241–433, 2015.
  37. Unsupervised learning of image manifolds by semidefinite programming. International journal of computer vision, 70:77–90, 2006.
  38. Handbook of semidefinite programming: theory, algorithms, and applications, volume 27. Springer Science & Business Media, 2012.
  39. SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints. Mathematical Programming Computation, 7(3):331–366, 2015.
  40. R. Y. Zhang. Parameterized complexity of chordal conversion for sparse semidefinite programs with small treewidth. arXiv preprint arXiv:2306.15288, 2023.
  41. R. Y. Zhang and J. Lavaei. Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion. Mathematical programming, 188:351–393, 2021.
  42. Chordal decomposition in operator-splitting methods for sparse semidefinite programs. Mathematical Programming, 180(1-2):489–532, 2020.

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Authors (2)

  1. Tianyun Tang 
  2. Kim-Chuan Toh 

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up

Tweets

Sign up for free to view the 1 tweet with 2 likes about this paper.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up for Free