scientific article; zbMATH DE number 7626764

MaRDI QIDQ5053271

No author found.

Publication date: 6 December 2022

Full work available at URL: https://jmlr.csail.mit.edu/papers/v22/20-033.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

generalized eigenvalue problemoptimal convergence rateRiemannian optimizationeigenvector computationshift-and-invert preconditioning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
• A feasible method for optimization with orthogonality constraints
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Self-consistent-field calculations using Chebyshev-filtered subspace iteration
• Introductory lectures on convex optimization. A basic course.
• Optimization and dynamical systems
• Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems
• Numerical Methods for Large Eigenvalue Problems
• Two-Point Step Size Gradient Methods
• The Riemannian Barzilai–Borwein method with nonmonotone line search and the matrix geometric mean computation
• Stochastic Gradient Descent on Riemannian Manifolds
• The Matrix Eigenvalue Problem
• A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
• RELATIONS BETWEEN TWO SETS OF VARIATES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item