Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $X \in \mathbb{R}^{m\times n}$ be a matrix with rank $r$.

How can we find the optimal $\tilde{X} \in \mathbb{R}^{m\times n}$ whose rank is $k$ where $k\leq r$ and the reconstruction error in terms of maximum absolute column sum norm is minimized? That is

$$e=\|X-\tilde{X}\|_1 = \max_j \sum_i|X_{ij}-\tilde{X}_{ij}|$$

is minimized.

I know that the optimal solution is the $k$-reduced SVD when Frobenius-norm or spectral norm is minimized. But I'm not familiar with optimization related to $l_1$-norm and I want to use it to find sparse bases to use in an audio processing project.

Is there an analytic closed form solution for this problem? Or can I find the $k$-rank approximation in an iterative numerical method?

share|cite|improve this question
The constraint $\textbf{rank}(\tilde{X}) \leq k$ seems difficult, because the rank function is not convex. Could you modify the problem to avoid this? For example, would you be happy to obtain a low-rank approximation to $X$? Penalizing the "nuclear norm" of $\tilde{X}$ in your objective function will encourage the optimal value to be low-rank. – littleO Nov 6 '12 at 10:40
Thank you very much for the comment. Actually, this was the problem we were discussing in our reading group. That's why I wanted to learn if there's an already known way to solve it. – petrichor Nov 6 '12 at 13:25

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.