Saddle point mirror descent algorithm for the robust PageRank problem
From MaRDI portal
Publication:505294
DOI10.1134/S0005117916080075zbMath1401.68016OpenAlexW2530286113MaRDI QIDQ505294
Publication date: 20 January 2017
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117916080075
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Uses Software
Cites Work
- Primal-dual subgradient methods for convex problems
- Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem
- A proximal-based deomposition method for compositions method for convex minimization problems
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Regularization-based solution of the PageRank problem for large matrices
- Recursive aggregation of estimators by the mirror descent algorithm with averaging
- Robust Stochastic Approximation Approach to Stochastic Programming
- Variational Analysis
- Solving variational inequalities with Stochastic Mirror-Prox algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Saddle point mirror descent algorithm for the robust PageRank problem
