A second-order method on the Stiefel manifold via Newton$\unicode{x2013}$Schulz
Abstract
Retraction-free approaches offer attractive low-cost alternatives to Riemannian methods on the Stiefel manifold, but they are often first-order, which may limit the efficiency under high-accuracy requirements. To this end, we propose a second-order method landing on the Stiefel manifold without invoking retractions, which is proved to enjoy local quadratic (or superlinear for its inexact variant) convergence. The update consists of the sum of (i) a component tangent to the level set of the const...
Description / Details
Retraction-free approaches offer attractive low-cost alternatives to Riemannian methods on the Stiefel manifold, but they are often first-order, which may limit the efficiency under high-accuracy requirements. To this end, we propose a second-order method landing on the Stiefel manifold without invoking retractions, which is proved to enjoy local quadratic (or superlinear for its inexact variant) convergence. The update consists of the sum of (i) a component tangent to the level set of the constraint-defining function that aims to reduce the objective and (ii) a component normal to the same level set that reduces the infeasibility. Specifically, we construct the normal component via NewtonSchulz, a fixed-point iteration for orthogonalization. Moreover, we establish a geometric connection between the NewtonSchulz iteration and Stiefel manifolds, in which NewtonSchulz moves along the normal space. For the tangent component, we formulate a modified Newton equation that incorporates NewtonSchulz. Numerical experiments on the orthogonal Procrustes problem, principal component analysis, and real-data independent component analysis illustrate that the proposed method performs better than the existing methods.
Source: arXiv:2605.02838v1 - http://arxiv.org/abs/2605.02838v1 PDF: https://arxiv.org/pdf/2605.02838v1 Original Link: http://arxiv.org/abs/2605.02838v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
May 5, 2026
Artificial Intelligence
AI
0