Decomposed structured subsets for semidefinite and sum-of-squares optimization

Journal article

Semidefinite programs (SDPs) are standard convex problems that are frequently found in control and optimization applications. Interior-point methods can solve SDPs in polynomial time up to arbitrary accuracy, but scale poorly as the size of matrix variables and the number of constraints increases. To improve scalability, SDPs can be approximated with lower and upper bounds through the use of structured subsets (e.g., diagonally-dominant and scaled-diagonally dominant matrices). Meanwhile, any underlying sparsity or symmetry structure may be leveraged to form an equivalent SDP with smaller positive semidefinite constraints. In this paper, we present a notion of decomposed structured subsets to approximate an SDP with structured subsets after an equivalent conversion. The lower/upper bounds found by approximation after conversion become tighter than the bounds obtained by approximating the original SDP directly. We apply decomposed structured subsets to semidefinite and sum-of-squares optimization problems with examples of norm estimation and constrained polynomial optimization. An existing basis pursuit method is adapted into this framework to iteratively refine bounds.

Authors: Miller, J; Zheng, Y; Sznaier, M; Papachristodoulou, A

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Elsevier
• Journal: Automatica
• Volume: 137
• Article number: 110125
• Publication date: 2022-01-06
• Acceptance date: 2021-11-15
• DOI: 10.1016/j.automatica.2021.110125
• ISSN: 0005-1098
• Language: English
• Keywords: semidefinite programming; FFR; chordal decomposition; approximation; sum of squares