A penalty function for generalized orthogonality constraints matches first- and second-order stationary points of the original problem and runs faster than manifold optimization.
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
-
Improved Penalty Function Approaches for Optimization Problems with General Orthogonality
A penalty function for generalized orthogonality constraints matches first- and second-order stationary points of the original problem and runs faster than manifold optimization.