Grassmannian optimization is NP-hard
Published in arXiv (accepted by SIOPT), 2025
NP-hardness of quadratic optimization over Grassmannian
Recommended citation: Zehua Lai, Lek-Heng Lim, and Ke Ye. "Grassmannian optimization is NP-hard." arXiv e-prints (2024): arXiv-2406.19377. https://arxiv.org/pdf/2406.19377