Recent content by Yossi

  1. Y

    Looking for tighter bound on symmetric PSD matrices products

    Homework Statement Let K and L be symmetric PSD matrices of size N*N, with all entries in [0,1]. Let i be any number in 1...N and K’, L’ be two new symmetric PSD matrices, each with only row i and column i different from K and L. I would like to obtain an upper bound of the equation below...