Nonmonotone feasible arc search algorithm for minimization on Stiefel manifold
From MaRDI portal
Publication:6103364
DOI10.1007/s40314-023-02310-0MaRDI QIDQ6103364
Douglas S. Gonçalves, Juliano B. Francisco
Publication date: 2 June 2023
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem
- Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds
- A feasible filter method for the nearest low-rank correlation matrix problem
- Numerical analysis of nonlinear eigenvalue problems
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Conjugate gradient algorithm for optimization under unitary matrix constraint
- Riemannian geometry of Grassmann manifolds with a view on algorithmic computation
- A constrained conjugate gradient method and the solution of linear equations
- Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization
- Efficient quasi-geodesics on the Stiefel manifold
- Non-monotone inexact restoration method for nonlinear programming
- A brief introduction to manifold optimization
- Trust-region methods on Riemannian manifolds
- Nonmonotone inexact restoration approach for minimization with orthogonality constraints
- Generalized power method for sparse principal component analysis
- Projection-like Retractions on Matrix Manifolds
- Manopt, a Matlab toolbox for optimization on manifolds
- The university of Florida sparse matrix collection
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Solution point differentiability without strict complementarity in nonlinear programming
- Two-Point Step Size Gradient Methods
- The Geometry of Algorithms with Orthogonality Constraints
- The Riemannian Barzilai–Borwein method with nonmonotone line search and the matrix geometric mean computation
- Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Multivariate Data Analysis on Matrix Manifolds
- A Riemannian Newton Algorithm for Nonlinear Eigenvalue Problems
- Benchmarking optimization software with performance profiles.
This page was built for publication: Nonmonotone feasible arc search algorithm for minimization on Stiefel manifold