Simultaneous Diagonalization of Matrices and its Applications in Quadratically Constrained Quadratic Programming

Abstract

An equivalence between attainability of simultaneous diagonalization (SD) and hidden convexity in quadratically constrained quadratic programming (QCQP) stimulates us to investigate necessary and sufficient SD conditions, which is one of the open problems posted by Hiriart-Urruty (SIAM Rev., 49 (2007), pp. 255-273) nine years ago. In this paper we give a necessary and sufficient SD condition for any two real symmetric matrices and offer a necessary and sufficient SD condition for any finite collection of real symmetric matrices under the existence assumption of a semi-definite matrix pencil. Moreover, we apply our SD conditions to QCQP, especially with one or two quadratic constraints, to verify the exactness of its second-order cone programming relaxation and to facilitate the solution process of QCQP.

19 pages

References in corpus (1)

• An exact duality theory for semidefinite programming based on sums of squares

Cited by in corpus (13)

• The Generalized Trust Region Subproblem: solution complexity and convex hull results
• Determining when an algebra is an evolution algebra
• Solving the problem of simultaneous diagonalization of complex symmetric matrices via congruence
• On Input Design for Regularized LTI System Identification: Power-constrained Input
• On Local Minimizers of Quadratically Constrained Nonconvex Homogeneous Quadratic Optimization with at Most Two Constraints
• Geometry of Selberg's bisectors in the symmetric space $SL(n,\mathbb{R})/SO(n,\mathbb{R})$
• New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs
• A linear-time algorithm for generalized trust region subproblems
• Simultaneous block diagonalization of a set of symmetric matrices via congruence
• Improving Tractability of Real-Time Control Schemes via Simplified $\mathcal{S}$-Lemma
• Unique superdiffusion induced by directionality in multiplex networks
• On local minimizers of generalized trust-region subproblem
• Explicit minimisation of a convex quadratic under a general quadratic constraint: a global, analytic approach