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.
$\begingroup$
$\endgroup$
2
-
$\begingroup$ 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... $\endgroup$– SuvritFeb 4, 2013 at 22:35
-
$\begingroup$ Thanks a lot for the answer. i tried another way using the maximization of k-largest eigenvalues. $\endgroup$– RoyehFeb 23, 2013 at 0:03
Add a comment
|