Formulas for calculating the extremal ranks and inertias of a matrix-valued function subject to matrix equation restrictions

Abstract

Matrix rank and inertia optimization problems are a class of discontinuous optimization problems in which the decision variables are matrices running over certain matrix sets, while the ranks and inertias of the variable matrices are taken as integer-valued objective functions. In this paper, we establish a group of explicit formulas for calculating the maximal and minimal values of the rank and inertia objective functions of the Hermitian matrix expression A1 - B1XB1* subject to the common Hermitian solution of a pair of consistent matrix equations B2XB*2 = A2 and B3XB3* = A3, and Hermitian solution of the consistent matrix equation B4X= A4, respectively. Many consequences are obtained, in particular, necessary and sufficient conditions are established for the triple matrix equations B1XB*1 =A1, B2XB*2 = A2 and B3XB*3 = A3 to have a common Hermitian solution, as necessary and sufficient conditions for the two matrix equations B1XB*1 =A1 and B4X = A4 to have a common Hermitian solution.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…