Steepest descent algorithm on orthogonal Stiefel manifolds

Abstract

Considering orthogonal Stiefel manifolds as constraint manifolds, we give an explicit description of a set of local coordinates that also generate a basis for the tangent space in any point of the orthogonal Stiefel manifolds. We show how this construction depends on the choice of a submatrix of full rank. Embedding a gradient vector field on an orthogonal Stiefel manifold in the ambient space, we give explicit necessary and sufficient conditions for a critical point of a cost function defined on such manifolds. We explicitly describe the steepest descent algorithm on the orthogonal Stiefel manifold using the ambient coordinates and not the local coordinates of the manifold. We point out the dependence of the recurrence sequence that defines the algorithm on the choice of a full rank submatrix. We illustrate the algorithm in the case of Brockett cost functions.

References in corpus (2)

• Hessian Operators on Constraint Manifolds
• Newton Algorithm on Constraint Manifolds and the 5-electron Thomson problem

Cited by in corpus (8)

• Procrustes Analysis with Deformations: A Closed-Form Solution by Eigenvalue Decomposition
• On Generalizing Trace Minimization
• Second order optimality on orthogonal Stiefel manifolds
• A Theory of the NEPv Approach for Optimization On the Stiefel Manifold
• KernelGPA: A Globally Optimal Solution to Deformable SLAM in Closed-form
• Landscape Correspondence of Empirical and Population Risks in the Eigendecomposition Problem
• Laplace-Beltrami operator on the orthogonal group in Cartesian coordinates
• Characterization of the critical points for the free energy of a Cosserat problem