MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

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

I have a matrix $X \in \mathbb{R}^{m\times n}$ and I want to estimate it with a dense matrix $Y^{m\times n}$ such that $Y$ is still close to $X$ in some distance measure. Is this doable in a computationally efficient way? While the sparse estimation is commonly used, but all my efforts for a regularization based solution ended up in non-convex optimization.

share|cite|improve this question
Why not find a sparse neighbor and then add a matrix of all epsilons? – Dustin G. Mixon May 28 '13 at 0:16
Theoretically you are right. But practically, I want the non-zero elements to be non-negligible, as well. – Taha May 28 '13 at 0:45
You should be more specific in your definition of "dense." – Dustin G. Mixon May 28 '13 at 0:49

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.