activity
20242026
most citedEuclidean distance degree in manifold optimization

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing math.OCShow all

2 papers · 1 filter

math.OC2025

Stiefel optimization is NP-hard

Zehua Lai, Lek-Heng Lim, Tianyun Tang

We show that linearly constrained linear optimization over a Stiefel or Grassmann manifold is NP-hard in general. We show that the same is true for unconstrained quadratic optimiza…

math.OC2025★ 1 cited

Euclidean distance degree in manifold optimization

Zehua Lai, Lek-Heng Lim, Ke Ye

We determine the Euclidean distance degrees of the three most common manifolds arising in manifold optimization: flag, Grassmann, and Stiefel manifolds. For the Grassmannian, we wi…