Random Projections for Semidefinite Programming

Random projections can reduce the dimensionality of point sets while keeping approximate congruence. Applying random projections to optimization problems raises many theoretical and computational issues. Most of the theoretical issues in the application of random projections to conic programming were addressed in Liberti et al. (Linear Algebr. Appl. 626:204–220, 2021) [1]. This paper focuses on semidefinite programming