An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimizationHeng Yang, Kim-Chuan Toh, Ling Liang et al.|Mathematical Programming|2022Cited by 23
STRIDE along Spectrahedral Vertices for Solving Large-Scale Rank-One Semidefinite Relaxations.Heng Yang, Luca Carlone, Kim-Chuan Toh et al.|arXiv (Cornell University)|2021Cited by 2
An Inexact Projected Gradient Method with Rounding and Lifting by Nonlinear Programming for Solving Rank-One Semidefinite Relaxation of Polynomial OptimizationHeng Yang, Kim-Chuan Toh, Ling Liang et al.|arXiv (Cornell University)|2021Cited by 2