New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs

Abstract

A set of quadratic forms is simultaneously diagonalizable via congruence (SDC) if there exists a basis under which each of the quadratic forms is diagonal. This property appears naturally when analyzing quadratically constrained quadratic programs (QCQPs) and has important implications in this context. This paper extends the reach of the SDC property by studying two new related but weaker notions of simultaneous diagonalizability. Specifically, we say that a set of quadratic forms is almost SDC (ASDC) if it is the limit of SDC sets and d-restricted SDC (d-RSDC) if it is the restriction of an SDC set in up to d-many additional dimensions. Our main contributions are a complete characterization of the ASDC pairs and the nonsingular ASDC triples, as well as a sufficient condition for the 1-RSDC property for pairs of quadratic forms. Surprisingly, we show that every singular pair is ASDC and that almost every pair is 1-RSDC. We accompany our theoretical results with preliminary numerical experiments applying the RSDC property to QCQPs with a single quadratic constraint.

References in corpus (6)

• Consensus-ADMM for General Quadratically Constrained Quadratic Programming
• A Second-Order Cone Based Approach for Solving the Trust Region Subproblem and Its Variants
• Simultaneous Diagonalization of Matrices and its Applications in Quadratically Constrained Quadratic Programming
• Trust Region Subproblem with a Fixed Number of Additional Linear Inequality Constraints has Polynomial Complexity
• A Geometric View of SDP Exactness in QCQPs and its Applications
• Effective Algorithms for Optimal Portfolio Deleveraging Problem with Cross Impact