Adaptive randomized algori for finding eigenvector of stochastic matrix with application to pagerank

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2009, Pages 127-132

  Nazin, Alexander ^a   Polyak, Boris ^a  

^a TRAPEZNIKOV INSTITUTE OF CONTROL SCIENCES   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; MULTI AGENT SYSTEMS; OPTIMIZATION; STOCHASTIC SYSTEMS;

DISTRIBUTED COMPUTATIONS; LARGEST EIGENVALUES; NETWORKED CONTROLS; NUMBER OF ITERATIONS; RANDOMIZED ALGORITHMS; RATE OF CONVERGENCE; STOCHASTIC MATRICES; STOCHASTIC OPTIMIZATIONS;

ITERATIVE METHODS;

EID: 77950819422     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2009.5400036     Document Type: Conference Paper

References (15)

1. H. Ishii and R. Tempo, A distributed randomized approach for the PageRank computation, 1, Proc. 47th IEEE Conf. on Decision and Control, 3523-3528, 2008.
2. S. Brin and L. Page, The anatomy of a large-scale hypertextual web search engine, Comput. Netw. ISDN Syst., 30(1-7):107-117, 1998.
3. A.N. Langville and C.D. Meyer, Google's PageRank and Beyond: The Science of Search Engine Rankings, Princeton University Press; 2006.
4. H. Ishii and R. Tempo, A distributed randomized approach for the PageRank computation, 2, Proc. 47th IEEE Conf. on Decision and Control, 3529-3534, 2008.
5. R. Tempo, G. Calafiore, and F. Dabbene, Randomized Algorithms for Analysis and Control of Uncertain Systems, Springer, London; 2005.
6. A.S. Nemirovski and D.B. Yudin, Problem Complexity and Method Efficiency in Optimization, New York, Wiley-Interscience; 1983.
7. Yu. Nesterov. Primal-dual subgradient methods for convex problems. Mathematical Programming, 2007. DOI: 10.1007/s10107-007-0149-x.
8. A.B. Juditsky, A.V. Nazin, A.B. Tsybakov, and N. Vayatis, Recursive aggregation of estimators by the mirror descent algorithm with averaging. Problems of Information Transmission, 41(4):368-384, 2005.
9. A. Juditsky, G. Lan, A. Nemirovski, and A. Shapiro, Stochastic Approximation Approach to Stochastic Programming, 2007. http://www.optimization- online.org/DB HTML/2007/09/1787.html
10. A.V. Nazin, Solution to a Particular Deterministic Problem in Finite High Dimension by the Recursive Randomized Mirror Descent Algorithm, 8th Meeting on Mathematical Statistics, CIRM, Luminy, France, 2008. http://www.cirm.univ-mrs.fr
11. A.V. Nazin and B.T. Polyak, The Randomized Algorithm for Finding an Eigenvector of the Stochastic Matrix with Application to PageRank, Doklady Mathematics, 79(3):424-427, 2009.
12. A.V. Nazin and B.T. Polyak, A Randomized Algorithm for Finding Eigenvector of Stochastic Matrix with Application to PageRank Problem, 3rd IEEE Multi-conference on Systems and Control (MSC 2009), Saint-Petersburg, Russia, July 8-10, 2009.
13. R.T. Rockafellar and R.J.B. Wets, Variational Analysis, New York, Springer; 1998.
14. A. Ben-Tal and A.S. Nemirovski, The Conjugate Barrier Mirror Descent Method for Non-Smooth Convex Optimization, MINERVA Optim. Center Report., Haifa, Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, 1999. http://iew3.technion.ac.il/Labs/Opt/opt/Pap/CP MD.pdf
15. Claire Tauvel. Optimisation stochastique à grande échelle. PhD thesis, Universite Joseph Fourier, December 2008.