Linearly Convergent Randomized Iterative Methods for Computing the Pseudoinverse - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year :

Linearly Convergent Randomized Iterative Methods for Computing the Pseudoinverse

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.
Fichier principal
Vignette du fichier
pseudo_inverse.pdf (668.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01430489 , version 1 (09-01-2017)

Identifiers

  • HAL Id : hal-01430489 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More