From Eckart and Young approximation to Moreau envelopes and vice versa
In matricial analysis, the theorem of Eckart and Young provides a best approximation of an arbitrary matrix by a matrix of rank at most . In variational analysis or optimization, the Moreau envelopes are appropriate ways of approximating or regularizing the rank function. We prove here that we can go forwards and backwards between the two procedures, thereby showing that they carry essentially the same information.