Solving rank-constrained semidefinite programs in exact arithmetic.

Published in: CoRR (2016)

Keyphrases

semidefinite
semidefinite programming
sufficient conditions
exact solution
complementarity problems
interior point methods
convex relaxation
positive semidefinite
objective function
optimal solution
graph cuts
higher dimensional
convex sets