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

TL;DR
This paper derives explicit formulas for the extremal ranks and inertias of a matrix-valued function under certain matrix equation constraints, advancing matrix optimization theory.
Contribution
It provides new explicit formulas for extremal ranks and inertias of Hermitian matrix expressions with specific matrix equation restrictions.
Findings
Formulas for maximal and minimal rank and inertia values are established.
Conditions for the existence of common Hermitian solutions to matrix equations are derived.
Necessary and sufficient conditions for solution existence are provided.
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 subject to the common Hermitian solution of a pair of consistent matrix equations and , and Hermitian solution of the consistent matrix equation , respectively. Many consequences are obtained, in particular, necessary and sufficient conditions are established for the triple matrix equations , and to have a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Advanced Optimization Algorithms Research · Sparse and Compressive Sensing Techniques
