Stiefel optimization is NP-hard
Published in Optimization Letters, 2025
Recommended citation: Zehua Lai, Lek-Heng Lim, and Tianyun Tang. "Stiefel optimization is NP-hard." Optimization Letters (to appear). https://arxiv.org/pdf/2507.02839
We show that linear programming over Stiefel manifold is NP-hard.