Efficient numerical methods to solve sparse linear equations with application to PageRank

DOI10.1080/10556788.2020.1858297zbMath1502.90122arXiv1508.07607OpenAlexW2784932507MaRDI QIDQ5043846

Yury Maximov, Anton S. Anikin, Dmitry Kamzolov, Alexander V. Gasnikov, Yu. E. Nesterov, Alexander Yu. Gornov

Publication date: 6 October 2022

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.07607

zbMATH Keywords

randomizationsparsityFrank-Wolfe methodPageRank\(\ell_1\)-optimization

Mathematics Subject Classification ID

Convex programming (90C25) Minimax problems in mathematical programming (90C47) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primal-dual subgradient methods for convex problems
• Finding the stationary states of Markov chains by iterative methods
• Subgradient methods for huge-scale optimization problems
• Fast distributed PageRank computation
• Conditional gradient algorithms for norm-regularized smooth convex optimization
• Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem
• Lectures on convex optimization
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Adaptive methods for the computation of PageRank
• Universal method for stochastic composite optimization problems
• Complexity bounds for primal-dual methods minimizing the model of objective function
• A sublinear-time randomized approximation algorithm for matrix games
• On efficient randomized algorithms for finding the PageRank vector
• On the efficiency of a randomized mirror descent algorithm in online optimization problems
• Regularization-based solution of the PageRank problem for large matrices
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• Robust Stochastic Approximation Approach to Stochastic Programming
• Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent
• Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• Prediction, Learning, and Games
• The elements of statistical learning. Data mining, inference, and prediction