On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems
- 7 January 2023
- journal article
- research article
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 42 (1) , 1-20
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (No. 12071149)
- Science and Technology Commission of Shanghai Municipality (No. 20511100200, No. 22DZ2229014)
- Science and Technology Commission of Shanghai Municipality (No. 21JC1402500)
This publication has 17 references indexed in Scilit:
- Random Block Coordinate Descent Methods for Linearly Constrained Optimization over NetworksJournal of Optimization Theory and Applications, 2017
- Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization ProblemsSIAM Journal on Optimization, 2017
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz MethodsSIAM Journal on Matrix Analysis and Applications, 2015
- On the complexity analysis of randomized block-coordinate descent methodsMathematical Programming, 2014
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite functionMathematical Programming, 2012
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization ProblemsSIAM Journal on Optimization, 2012
- Randomized Methods for Linear Constraints: Convergence Rates and ConditioningMathematics of Operations Research, 2010
- A Randomized Kaczmarz Algorithm with Exponential ConvergenceJournal of Fourier Analysis and Applications, 2008
- Numerical aspects of gram-schmidt orthogonalization of vectorsLinear Algebra and its Applications, 1983
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least SquaresACM Transactions on Mathematical Software, 1982