A randomized feasible algorithm for optimization with orthogonal constraints
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Broyden class of quasi-Newton methods for Riemannian optimization
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Riemannian BFGS method without differentiated retraction for nonconvex optimization problems
- A Riemannian symmetric rank-one trust-region method
- A brief introduction to manifold optimization
- A class of smooth exact penalty function methods for optimization problems with orthogonality constraints
- A constrained optimization algorithm for total energy minimization in electronic structure calculations
- A feasible method for optimization with orthogonality constraints
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- A limited-memory Riemannian symmetric rank-one trust-region method with a restart strategy
- A splitting method for orthogonality constrained problems
- Adaptive quadratically regularized Newton method for Riemannian optimization
- An Orthogonalization-Free Parallelizable Framework for All-Electron Calculations in Density Functional Theory
- Analysis of a quadratic programming decomposition algorithm
- Augmented-Lagrangian regularization of matrix-valued maps
- Conjugate gradient algorithm for optimization under unitary matrix constraint
- Direct minimization for calculating invariant subspaces in density functional computations of the electronic structure
- Intrinsic formulation of KKT conditions and constraint qualifications on smooth manifolds
- Intrinsic representation of tangent vectors and vector transports on matrix manifolds
- KSSOLV -- a MATLAB toolbox for solving the Kohn-Sham equations
- Manopt, a Matlab toolbox for optimization on manifolds
- Optimization algorithms exploiting unitary constraints
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- Projected nonmonotone search methods for optimization with orthogonality constraints
- Projection-like retractions on matrix manifolds
- Recent Developments in the Modeling, Analysis, and Numerics of Ferromagnetism
- Riemannian optimization via Frank-Wolfe methods
- Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- The Geometry of Algorithms with Orthogonality Constraints
- Trace optimization and eigenproblems in dimension reduction methods.
- Trace-penalty minimization for large-scale eigenspace computation
- Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements
- Trust-region methods on Riemannian manifolds
- Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization
This page was built for publication: A randomized feasible algorithm for optimization with orthogonal constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6937403)
