Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Linearly Convergent Randomized Iterative Methods for Computing the Pseudoinverse

Robert M Gower 1 Peter Richtárik 2 
1 SIERRA - Statistical Machine Learning and Parsimony
DI-ENS - Département d'informatique - ENS Paris, CNRS - Centre National de la Recherche Scientifique, Inria de Paris
Abstract : We develop the first stochastic incremental method for calculating the Moore-Penrose pseu-doinverse of a real matrix. By leveraging three alternative characterizations of pseudoinverse matrices, we design three methods for calculating the pseudoinverse: two general purpose methods and one specialized to symmetric matrices. The two general purpose methods are proven to converge linearly to the pseudoinverse of any given matrix. For calculating the pseudoinverse of full rank matrices we present two additional specialized methods which enjoy a faster convergence rate than the general purpose methods. We also indicate how to develop randomized methods for calculating approximate range space projections, a much needed tool in inexact Newton type methods or quadratic solvers when linear constraints are present. Finally, we present numerical experiments of our general purpose methods for calculating pseudoinverses and show that our methods greatly outperform the Newton-Schulz method on large dimensional matrices.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Robert Gower Connect in order to contact the contributor
Submitted on : Monday, January 9, 2017 - 10:57:31 PM
Last modification on : Wednesday, June 8, 2022 - 12:50:05 PM
Long-term archiving on: : Monday, April 10, 2017 - 4:49:09 PM


Files produced by the author(s)


  • HAL Id : hal-01430489, version 1



Robert M Gower, Peter Richtárik. Linearly Convergent Randomized Iterative Methods for Computing the Pseudoinverse. 2017. ⟨hal-01430489⟩



Record views


Files downloads