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

Is there any suggestion about how could one construct a model that uses semidefinite programming that minimizes sum of k smallest eigenvalues of Laplacian matrix? I found two papers that have done something for the just bound not for optimization.

share|cite|improve this question
minimizing sum of $k$-largest is a convex problem; the sum of $k$-smallest eigenvalues is concave, and therefore, not really that conducive to minimization... – Suvrit Feb 4 '13 at 22:35
Thanks a lot for the answer. i tried another way using the maximization of k-largest eigenvalues. – Royeh Feb 23 '13 at 0:03

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.