6 citations · 6 across the 12 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2025
Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under -Smoothness
Nikita Kornilov, Philip Zmushko, Andrei Semenov +3
In recent years, non-convex optimization problems are more often described by generalized -smoothness assumption rather than standard one. Meanwhile, severely corrupted…
math.OC2014
Efficient randomized algorithms for PageRank problem
Alexander Gasnikov, Denis Dmitriev
In the paper we compare well known numerical methods of finding PageRank vector. We propose Markov Chain Monte Carlo method and obtain a new estimation for this method. We also pro…