Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 2016, Issue 8, Pages 105–124 (Mi at14529)  
This article is cited in 2 scientific papers (total in 2 papers)

Stochastic Systems, Queuing Systems

Saddle point mirror descent algorithm for the robust PageRank problem

A. V. Nazin, A. A. Tremba

Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia
Full-text PDF (955 kB) Citations (2)
References:
PDF
HTML
Abstract: In order to solve robust PageRank problem a saddle-point Mirror Descent algorithm for solving convex-concave optimization problems is enhanced and studied. The algorithm is based on two proxy functions, which use specificities of value sets to be optimized on (min-max search). In robust PageRank case the ones are entropy-like function and square of Euclidean norm. The saddle-point Mirror Descent algorithm application to robust PageRank leads to concrete complexity results, which are being discussed alongside with illustrative numerical example.
Funding agency Grant number
Russian Foundation for Basic Research 14-07-00067
13-01-00406
Ministry of Education and Science of the Russian Federation 11.G34.31.0073
This work was supported in part by the Russian Foundation for Basic Research, projects nos. 14-07-00067 and 13-01-00406. First author is also partially supported by MIPT Premolab Laboratory, Russian Federation grant no. 11.G34.31.0073.
Presented by the member of Editorial Board: P. S. Shcherbakov

Received: 29.01.2015
English version:
Automation and Remote Control, 2016, Volume 77, Issue 8, Pages 1403–1418
DOI: https://doi.org/10.1134/S0005117916080075
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: A. V. Nazin, A. A. Tremba, “Saddle point mirror descent algorithm for the robust PageRank problem”, Avtomat. i Telemekh., 2016, no. 8, 105–124; Autom. Remote Control, 77:8 (2016), 1403–1418
Citation in format AMSBIB
\Bibitem{NazTre16}
\by A.~V.~Nazin, A.~A.~Tremba
\paper Saddle point mirror descent algorithm for the robust PageRank problem
\jour Avtomat. i Telemekh.
\yr 2016
\issue 8
\pages 105--124
\mathnet{http://mi.mathnet.ru/at14529}
\elib{https://elibrary.ru/item.asp?id=27182845}
\transl
\jour Autom. Remote Control
\yr 2016
\vol 77
\issue 8
\pages 1403--1418
\crossref{https://doi.org/10.1134/S0005117916080075}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000382146700007}
\elib{https://elibrary.ru/item.asp?id=27135051}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84981288361}
Linking options:
  • https://www.mathnet.ru/eng/at14529
  • https://www.mathnet.ru/eng/at/y2016/i8/p105
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:323
    Full-text PDF :81
    References:53
    First page:21
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024