A new single-loop primal-dual algorithm solves nonsmooth nonconvex orthogonally constrained problems with O(ε^{-3}) complexity to ε-KKT points and demonstrates superior performance in numerical tests.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Primal-Dual Methods for Nonsmooth Nonconvex Optimization with Orthogonality Constraints
A new single-loop primal-dual algorithm solves nonsmooth nonconvex orthogonally constrained problems with O(ε^{-3}) complexity to ε-KKT points and demonstrates superior performance in numerical tests.