First order optimality conditions and steepest descent algorithm on orthogonal Stiefel manifolds
From MaRDI portal
Publication:2010134
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- A Procrustes problem on the Stiefel manifold
- A feasible method for optimization with orthogonality constraints
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- A modified Casteljau algorithm to solve interpolation problems on Stiefel manifolds
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Extrema of sums of heterogeneous quadratic forms
- Geometrical dissipation for dynamical systems
- Hessian operators on constraint manifolds
- Newton algorithm on constraint manifolds and the 5-electron Thomson problem
- Newton's method on Riemannian manifolds and a geometric model for the human spine
- On alternating direction methods of multipliers: a historical perspective
- On minimization on Stiefel manifolds
- Optimization algorithms exploiting unitary constraints
- Some global optimization problems on Stiefel manifolds
- The Geometry of Algorithms with Orthogonality Constraints
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Worst-case violation of sampled convex programs for optimization with uncertainty
Cited in
(13)- Globally maximizing the ratio of two generalized quadratic matrix form functions over the Stiefel manifold
- Laplace-Beltrami operator on the orthogonal group in ambient (Euclidean) coordinates
- Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations
- Structured low-rank approximation: optimization on matrix manifold approach
- Procrustes analysis with deformations: a closed-form solution by eigenvalue decomposition
- Stochastic consensus dynamics for nonconvex optimization on the Stiefel manifold: mean-field limit and convergence
- On generalizing trace minimization principles
- A theory of the NEPv approach for optimization on the Stiefel manifold
- Second order optimality on orthogonal Stiefel manifolds
- A computationally efficient Lie group optimization algorithm for independent component analysis with Schur-toral decomposition and its application to image restoring
- Characterization of the critical points for the shear-stretch strain energy of a Cosserat problem
- Learning sparsity-promoting regularizers using bilevel optimization
- Maximizing sum of coupled traces with applications
This page was built for publication: First order optimality conditions and steepest descent algorithm on orthogonal Stiefel manifolds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010134)
