The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank
type: Item
instance of: scholarly article
title: The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank
zbMATH Open document ID: 1176.65042
DOI: 10.1134/S1064562409030338
published in: Doklady Mathematics
publication date: 2009-10-26T00:00:00Z
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 15B51
Mathematics Subject Classification ID: 65C20
Mathematics Subject Classification ID: 60H30
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 5621475
zbMATH Keywords: eigenvector
zbMATH Keywords: largest eigenvalue
zbMATH Keywords: stochastic matrix
zbMATH Keywords: randomized algorithm
zbMATH Keywords: convergence
zbMATH Keywords: mirror-descent method
zbMATH Keywords: convex stochastic optimization
zbMATH Keywords: PageRank problem
author: Alexander Nazin
author: Boris T. Polyak
MaRDI profile type: Publication
cites work: Q5491464
cites work: Randomized algorithms for analysis and control of uncertain systems. With a foreword by M. Vidyasagar
cites work: Smooth minimization of non-smooth functions
cites work: Variational Analysis
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
description: scientific article; zbMATH DE number 5621475