Anton Rodomanov

Orcid: 0000-0001-9656-8554

According to our database1, Anton Rodomanov authored at least 11 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Non-Convex Stochastic Composite Optimization with Polyak Momentum.
CoRR, 2024

2023
Subgradient ellipsoid method for nonsmooth convex problems.
Math. Program., May, 2023

Polynomial Preconditioning for Gradient Methods.
Proceedings of the International Conference on Machine Learning, 2023

2022
Rates of superlinear convergence for classical quasi-Newton methods.
Math. Program., 2022

2021
Greedy Quasi-Newton Methods with Explicit Superlinear Convergence.
SIAM J. Optim., 2021

New Results on Superlinear Convergence of Classical Quasi-Newton Methods.
J. Optim. Theory Appl., 2021

2020
A Randomized Coordinate Descent Method with Volume Sampling.
SIAM J. Optim., 2020

Smoothness Parameter of Power of Euclidean Norm.
J. Optim. Theory Appl., 2020

2016
A Superlinearly-Convergent Proximal Newton-type Method for the Optimization of Finite Sums.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Primal-Dual Method for Searching Equilibrium in Hierarchical Congestion Population Games.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016

2014
Putting MRFs on a Tensor Train.
Proceedings of the 31th International Conference on Machine Learning, 2014


  Loading...