Linear Programming on the Stiefel Manifold
Linear Programming on the Stiefel Manifold
.Linear programming on the Stiefel manifold (LPS) is studied for the first time. It aims at minimizing a linear objective function over the set of all \(p\)-tuples of orthonormal vectors in \(\mathbb{R}^n\) satisfying \(k\) additional linear constraints. Despite the classical polynomial-time solvable case \(k=0\), general (LPS) is NP-hard. According to …