Given the matrix $ A \in \mathbb{R}^{m\times n}$ of rank k, the problem is to find a matrix $ B \in \mathbb{R}^{m\times n}$ of rank c<k iteratively minimizing $ \left \| A – B_i \right \|_{F}$ If the sequence $ \left \| A – B_i \right \|_{F}$ is monotonically decreasing at every step, is itRead more