A feasible method for solving an SDP relaxation of the quadratic knapsack problem
In this paper, we consider a semidefinite programming (SDP) relaxation of the quadratic knapsack problem. After applying low-rank factorization, we get a nonconvex problem, whose feasible region is an algebraic […]
Solving graph equipartition SDPs on an algebraic variety
Semidefinite programs are generally challenging to solve due to their high dimensionality. Burer and Monteiro developed a non-convex approach to solve linear SDP problems by applying its low rank property. […]
Dissolving Constraints for Riemannian Optimization
In this paper, we consider optimization problems over closed embedded submanifolds of ℝ𝑛, which are defined by the constraints c(x) = 0. We propose a class of constraint-dissolving approaches for these Riemannian optimization problems. […]
