Efficient coordinate-wise leading eigenvector computation

MaRDI QIDQ4617641zbMATH OpenFDO

Authors Jialei Wang, Weiran Wang, Dan Garber, Nathan Srebro

Publication date 6 February 2019

Full work available at URL https://arxiv.org/abs/1702.07834, http://proceedings.mlr.press/v83/wang18a/wang18a.pdf

Mathematics Subject Classification ID

Quadratic programming (90C20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• Coordinatewise descent methods for leading eigenvalue problem
• Second order accurate distributed eigenvector computation for extremely large matrices
• The charming leading eigenpair
• Adaptive algorithms for first principal eigenvector computation
• The power method and beyond

Cited in

(3)

• Coordinatewise descent methods for leading eigenvalue problem
• Tensor Canonical Correlation Analysis With Convergence and Statistical Guarantees
• scientific article; zbMATH DE number 7626764 (Why is no real title available?)

This page was built for publication: Efficient coordinate-wise leading eigenvector computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4617641)