Implicit steepest descent algorithm for optimization with orthogonality constraints
From MaRDI portal
Publication:2673531
DOI10.1007/S11590-021-01801-5zbMATH Open1493.90191OpenAlexW3202484030MaRDI QIDQ2673531FDOQ2673531
Authors: Harry Oviedo 
Publication date: 10 June 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-021-01801-5
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
eigenvalue problemRiemannian optimizationtotal energy minimizationorthogonality constrained optimizationgradient type methods
Cites Work
- The University of Florida sparse matrix collection
- A feasible method for optimization with orthogonality constraints
- Manopt, a Matlab toolbox for optimization on manifolds
- Benchmarking optimization software with performance profiles.
- Generalized power method for sparse principal component analysis
- The Geometry of Algorithms with Orthogonality Constraints
- Title not available (Why is that?)
- Trace optimization and eigenproblems in dimension reduction methods.
- A Curvilinear Search Method for p-Harmonic Flows on Spheres
- An implicit trust-region method on Riemannian manifolds
- Two-Point Step Size Gradient Methods
- Optimization Techniques on Riemannian Manifolds
- Rank reduction of correlation matrices by majorization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Exact matrix completion via convex optimization
- A generalized solution of the orthogonal Procrustes problem
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Geometric Numerical Integration
- Title not available (Why is that?)
- A splitting method for orthogonality constrained problems
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Optimization algorithms exploiting unitary constraints
- Conjugate gradient algorithm for optimization under unitary matrix constraint
- Richtungsfelder und Fernparallelismus in \(n\)-dimensionalen Mannigfaltigkeiten
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization
- Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
- The Riemannian Barzilai-Borwein method with nonmonotone line search and the matrix geometric mean computation
- Riemannian Optimization on the Symplectic Stiefel Manifold
- A Riemannian Newton algorithm for nonlinear eigenvalue problems
- Matrix completion via a low rank factorization model and an augmented Lagrangean succesive overrelaxation algorithm
- Trace-penalty minimization for large-scale eigenspace computation
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- Projected nonmonotone search methods for optimization with orthogonality constraints
- A brief introduction to manifold optimization
- A non-monotone linear search algorithm with mixed direction on Stiefel manifold
- A spectral gradient projection method for the positive semi-definite procrustes problem
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
Uses Software
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)
