CoordinateWise Descent Methods for Leading Eigenvalue Problem
From MaRDI portal
Publication:5230665
DOI10.1137/18M1202505zbMath1420.65051arXiv1806.05647WikidataQ127338076 ScholiaQ127338076MaRDI QIDQ5230665
Yingzhou Li, Zhe Wang, Jian-feng Lu
Publication date: 28 August 2019
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.05647
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)
Related Items
A finite element configuration interaction method for Wigner localization, On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization, Weighted Trace-Penalty Minimization for Full Configuration Interaction, Tensor Ring Decomposition: Optimization Landscape and One-loop Convergence of Alternating Least Squares, A stochastic homotopy tracking algorithm for parametric systems of nonlinear equations, A weighted randomized Kaczmarz method for solving linear systems, Triangularized orthogonalization-free method for solving extreme eigenvalue problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
- Iteration complexity analysis of block coordinate descent methods
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Introductory lectures on convex optimization. A basic course.
- Orbital minimization method with \(\ell^{1}\) regularization
- Coordinate-friendly structures, algorithms and applications
- Coordinate descent algorithms
- First-order methods almost always avoid strict saddle points
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
- An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization
- Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming
- Permuted Coordinate-Wise Optimizations Applied to Lp-Regularized Image Deconvolution
- Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization
- A Coordinate-Descent Framework to Design Low PSL/ISL Sequences
- Inexact Block Coordinate Descent Methods for Symmetric Nonnegative Matrix Factorization
- On the complexity of parallel coordinate descent
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications
- An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
- An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations
- Convergence of a block coordinate descent method for nondifferentiable minimization
