Hi, I’m new with CVX and have some optimization problems. I am trying to optimize the algebraic connectivity of a graph by adding new edges. The SDP problem is formulated as following:

maximize lambda_2

s.t. L_0 + sum(x_e *h_e*h_e’) >= lambda_2*I - miu*eye(n)

0<= x <= 1

1’x=k

I dont know how to transform this problem in to matlab cvx code.

e is a candidate edges to be added to the graph. L_0 is the original Laplacian matrix of the graph.