The landing algorithm converges linearly near local minima for smooth non-convex optimization on the Stiefel manifold under a local Riemannian PŁ condition.
Unitary evolution recurrent neural networks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Local Linear Convergence of Infeasible Optimization with Orthogonal Constraints
The landing algorithm converges linearly near local minima for smooth non-convex optimization on the Stiefel manifold under a local Riemannian PŁ condition.