Solutions to 18 constrained optimization problems on the rank and inertia of the linear matrix function A+BXB

• Published in: Mathematical and computer modelling Vol. 55; no. 3-4 p.955-968; pp. 955 - 968
• Main Author: Tian, Yongge
• Format: Journal Article
• Language: English
• Published: 01.02.2012
• Subjects: computer techniques; decision making; mathematical models; system optimization
• DOI: 10.1016/j.mcm.2011.09.022
• ISSN: 0895-7177

The inertia of a Hermitian matrix is defined to be a triplet composed by the numbers of the positive, negative and zero eigenvalues of the matrix counted with multiplicities, respectively. If we take the inertia and rank of a Hermitian matrix as objective functions, then they are neither differentiable nor smooth. In this case, maximizing and minimizing the inertia and rank of a Hermitian matrix function could be regarded as a continuous-integer optimization problem. In this paper, we use some pure algebraic operations of matrices and their generalized inverses to derive explicit expansion formulas for calculating the global maximum and minimum ranks and inertias of the linear Hermitian matrix function A+BXB∗ subject to some rank and definiteness restrictions on the variable matrix X. Various direct consequences of the formulas in characterizing algebraic properties of A+BXB∗ are also presented. In particular, solutions to a group of constrained optimization problems on the rank and inertia of a partially specified block Hermitian matrix are given.