The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank (Q736033): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms for analysis and control of uncertain systems. With a foreword by M. Vidyasagar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank

Latest revision as of 01:59, 2 July 2024

scientific article
Language Label Description Also known as
English
The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank
scientific article

    Statements

    The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank (English)
    0 references
    26 October 2009
    0 references
    eigenvector
    0 references
    largest eigenvalue
    0 references
    stochastic matrix
    0 references
    randomized algorithm
    0 references
    convergence
    0 references
    mirror-descent method
    0 references
    convex stochastic optimization
    0 references
    PageRank problem
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references