arXiv:2007.04617 [math.NA]AbstractReferencesReviewsResources
Stochastic gradient descent for linear least squares problems with partially observed data
Published 2020-07-09Version 1
We propose a novel stochastic gradient descent method for solving linear least squares problems with partially observed data. Our method uses submatrices indexed by a randomly selected pair of row and column index sets to update the iterate at each step. Theoretical convergence guarantees in the mean square sense are provided. Numerical experiments are reported to demonstrate the theoretical findings.
Comments: 13 pages, 3 figures
Related articles: Most relevant | Search more
arXiv:2007.10853 [math.NA] (Published 2020-07-19)
A Stabilized GMRES Method for Solving Underdetermined Least Squares Problems
arXiv:2407.05945 [math.NA] (Published 2024-07-08)
An Arnoldi-based approach to polynomial and rational least squares problems
arXiv:2102.09878 [math.NA] (Published 2021-02-19)
Hierarchical Orthogonal Factorization: Sparse Least Squares Problems