A Note on the Convexity of ( I + KX-1 ) and its Constrained Optimization Representation
Abstract
This note provides another proof for the convexity ( strict convexity) of ( I + KX-1 ) over the positive definite cone for any given positive semidefinite matrix K 0 (positive definite matrix K 0) and the strictly convexity of (K + X-1) over the positive definite cone for any given K 0. Equivalent optimization representation with linear matrix inequalities (LMIs) for the functions ( I + KX-1 ) and (K + X-1) are presented. Their optimization representations with LMI constraints can be particularly useful for some related synthetic design problems.
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.