Minimum rank (skew) Hermitian solutions to the matrix approximation problem in the spectral norm

In this paper, we discuss the following two minimum rank matrix approximation problems in the spectral norm: (i) For given A = A(H) is an element of C-mxm, B is an element of C-mxn, determining X is an element of s(1), such that rank(X) = min(Y is an element of S1) rank(Y), s(1) = {Y = Y-H is an element of C-nxn : \\A- BYBH\\(2) = min}. (ii) For given A = -A(H) is an element of C-mxm, B is an element of C-mxn, determining X is an element of s(2), such that rank(X) = min(Y is an element of S2) rank(Y), s(2) = {Y = -Y-H is an element of C-nxn : \\A - BYBH\\(2) = min}. By applying the norm-preserving dilation theorem, the Hermitian-type (skew-Hermitian-type) generalized singular value decomposition (HGSVD, SHGSVD), we characterize the expressions of the minimum rank and derive a general form of minimum rank (skew) Hermitian solutions to the matrix approximation problem. (C) 2015 Elsevier B.V. All rights reserved.