Correlation between Two Projected Matrices Under Isometry Constraints

In this paper, we consider the problem of correlation between the projections of two square matrices. These matrices of dimensions m x[mult.] m and n x[mult.] n are projected on a subspace of lower-dimension k under isometry constraints. We maximize the correlation between these projections expressed as a trace function of the product of the projected matrices. First we connect this problem to notions such as the generalized numerical range, the field of values and the similarity matrix. We show that these concepts are particular cases of our problem for choices of m, n and k. The formulation used here applies to both real and complex matrices. We characterize the objective function, its fixed points, its optimal value for Hermitian and normal matrices and finally upper and lower bounds for the general case. An iterative algorithm based on the singular value decomposition is proposed to solve the optimization problem.

[1]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2]  R. Westwick,et al.  A theorem on numerical range , 1975 .

[3]  Henry Wolkowicz,et al.  On Lagrangian Relaxation of Quadratic Matrix Constraints , 2000, SIAM J. Matrix Anal. Appl..

[4]  S. Glaser,et al.  Unitary control in quantum ensembles: maximizing signal intensity in coherent spectroscopy , 1998, Science.

[5]  Terry Caelli,et al.  An eigenspace projection clustering method for inexact graph matching , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Nam-Kiu Tsing,et al.  The C-numerical range of matrices is star-shaped , 1996 .

[7]  Chi-Kwong Li,et al.  Norms that are invariant under unitary similarities and the C-numerical radii , 1989 .

[8]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..

[9]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[10]  Paul Van Dooren,et al.  A MEASURE OF SIMILARITY BETWEEN GRAPH VERTICES . WITH APPLICATIONS TO SYNONYM EXTRACTION AND WEB SEARCHING , 2002 .

[11]  Moshe Goldberg,et al.  Elementary inclusion relations for generalized numerical ranges , 1977 .

[12]  Chi-Kwong Li,et al.  Multiplicative Preservers of C-Numerical Ranges and Radii , 2004 .

[13]  Chi-Kwong Li,et al.  A Lower Bound on the C-Numerical Radius of Nilpotent Matrices Appearing in Coherent Spectroscopy , 2005, SIAM J. Matrix Anal. Appl..

[14]  R. Brockett,et al.  Dynamical systems that sort lists, diagonalize matrices and solve linear programming problems , 1988, Proceedings of the 27th IEEE Conference on Decision and Control.

[15]  Kaare Brandt Petersen,et al.  The Matrix Cookbook , 2006 .

[16]  John B. Moore,et al.  Gradient Flows Computing the C-numerical Range with Applications in NMR Spectroscopy , 2002, J. Glob. Optim..