Towards scalable algorithms for Max-Cut Semidefinite Programs

This thesis considers the problem of developing algorithms to reduce the memory cost of solving Max-Cut semidefinite programs, which is a class of optimization problems that arise in a variety of engineering applications.