Implicit steepest descent algorithm for optimization with orthogonality constraints
From MaRDI portal
Publication:2673531
Recommendations
- Accelerated optimization with orthogonality constraints
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- A feasible method for optimization with orthogonality constraints
- Projected nonmonotone search methods for optimization with orthogonality constraints
- An alternate gradient method for optimization problems with orthogonality constraints
Cites work
- scientific article; zbMATH DE number 5161643 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- A Curvilinear Search Method for p-Harmonic Flows on Spheres
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Riemannian Newton algorithm for nonlinear eigenvalue problems
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- A brief introduction to manifold optimization
- A feasible method for optimization with orthogonality constraints
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- A generalized solution of the orthogonal Procrustes problem
- A non-monotone linear search algorithm with mixed direction on Stiefel manifold
- A spectral gradient projection method for the positive semi-definite procrustes problem
- A splitting method for orthogonality constrained problems
- An implicit trust-region method on Riemannian manifolds
- Benchmarking optimization software with performance profiles.
- Conjugate gradient algorithm for optimization under unitary matrix constraint
- Exact matrix completion via convex optimization
- Generalized power method for sparse principal component analysis
- Geometric Numerical Integration
- Manopt, a Matlab toolbox for optimization on manifolds
- Matrix completion via a low rank factorization model and an augmented Lagrangean succesive overrelaxation algorithm
- Optimization Techniques on Riemannian Manifolds
- Optimization algorithms exploiting unitary constraints
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- Projected nonmonotone search methods for optimization with orthogonality constraints
- Rank reduction of correlation matrices by majorization
- Richtungsfelder und Fernparallelismus in \(n\)-dimensionalen Mannigfaltigkeiten
- Riemannian Optimization on the Symplectic Stiefel Manifold
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
- The Geometry of Algorithms with Orthogonality Constraints
- The Riemannian Barzilai-Borwein method with nonmonotone line search and the matrix geometric mean computation
- The University of Florida sparse matrix collection
- Trace optimization and eigenproblems in dimension reduction methods.
- Trace-penalty minimization for large-scale eigenspace computation
- Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization
- Two-Point Step Size Gradient Methods
Cited in
(7)- Projected nonmonotone search methods for optimization with orthogonality constraints
- Scaled fixed point algorithm for computing the matrix square root
- A collection of efficient retractions for the symplectic Stiefel manifold
- Global optimization with orthogonality constraints via stochastic diffusion on manifold
- Developing a new conjugate gradient algorithm with the benefit of some desirable properties of the Newton algorithm for unconstrained optimization
- A feasible method for optimization with orthogonality constraints
- Accelerated optimization with orthogonality constraints
This page was built for publication: Implicit steepest descent algorithm for optimization with orthogonality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673531)
