Pavel E. Dvurechensky

Orcid: 0000-0003-1201-2343

According to our database1, Pavel E. Dvurechensky authored at least 56 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Decentralized convex optimization on time-varying networks with application to Wasserstein barycenters.
Comput. Manag. Sci., June, 2024

Analysis of Kernel Mirror Prox for Measure Optimization.
CoRR, 2024

2023
Gradient-free methods for non-smooth convex stochastic optimization with heavy-tailed noise on convex compact.
Comput. Manag. Sci., December, 2023

Accelerated gradient methods with absolute and relative noise in the gradient.
Optim. Methods Softw., November, 2023

Generalized self-concordant analysis of Frank-Wolfe algorithms.
Math. Program., March, 2023

High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise.
CoRR, 2023

Algorithms for Euclidean-Regularised Optimal Transport.
Proceedings of the Optimization and Applications - 14th International Conference, 2023

High-Probability Bounds for Stochastic Optimization and Variational Inequalities: the Case of Unbounded Variance.
Proceedings of the International Conference on Machine Learning, 2023

2022
An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization.
SIAM J. Optim., 2022

Stochastic saddle-point optimization for the Wasserstein barycenter problem.
Optim. Lett., 2022

Zeroth-order methods for noisy Hölder-gradient functions.
Optim. Lett., 2022

Generalized Mirror Prox Algorithm for Monotone Variational Inequalities: Universality and Inexact Oracle.
J. Optim. Theory Appl., 2022

Oracle Complexity Separation in Convex Optimization.
J. Optim. Theory Appl., 2022

Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization.
EURO J. Comput. Optim., 2022

Accelerated variance-reduced methods for saddle-point problems.
EURO J. Comput. Optim., 2022

A conditional gradient homotopy method with applications to Semidefinite Programming.
CoRR, 2022

Clipped Stochastic Methods for Variational Inequalities with Heavy-Tailed Noise.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Decentralized Local Stochastic Extra-Gradient for Variational Inequalities.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

The power of first-order smooth optimization for black-box non-smooth problems.
Proceedings of the International Conference on Machine Learning, 2022

2021
Inexact model: a framework for optimization and variational inequalities.
Optim. Methods Softw., 2021

Primal-dual accelerated gradient methods with small-dimensional relaxation oracle.
Optim. Methods Softw., 2021

Universal intermediate gradient method for convex problems with inexact oracle.
Optim. Methods Softw., 2021

Composite optimization for the resource allocation problem.
Optim. Methods Softw., 2021

An accelerated directional derivative method for smooth stochastic convex optimization.
Eur. J. Oper. Res., 2021

First-Order Methods for Convex Optimization.
EURO J. Comput. Optim., 2021

Near-Optimal High Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise.
CoRR, 2021

Decentralized Distributed Optimization for Saddle Point Problems.
CoRR, 2021

On a Combination of Alternating Minimization and Nesterov's Momentum.
Proceedings of the 38th International Conference on Machine Learning, 2021

Newton Method over Networks is Fast up to the Statistical Precision.
Proceedings of the 38th International Conference on Machine Learning, 2021

An Accelerated Method For Decentralized Distributed Stochastic Optimization Over Time-Varying Graphs.
Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021

An Accelerated Second-Order Method for Distributed Stochastic Optimization.
Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021

2020
Recent Theoretical Advances in Non-Convex Optimization.
CoRR, 2020

Zeroth-Order Algorithms for Smooth Saddle-Point Problems.
CoRR, 2020

Stochastic Saddle-Point Optimization for Wasserstein Barycenters.
CoRR, 2020

Optimal Combination of Tensor Optimization Methods.
Proceedings of the Optimization and Applications - 11th International Conference, 2020

A Stable Alternative to Sinkhorn's Algorithm for Regularized Optimal Transport.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

Self-Concordant Analysis of Frank-Wolfe Algorithms.
Proceedings of the 37th International Conference on Machine Learning, 2020

Multimarginal Optimal Transport by Accelerated Alternating Minimization.
Proceedings of the 59th IEEE Conference on Decision and Control, 2020

2019
Generalized Self-concordant Hessian-barrier algorithms.
CoRR, 2019

Accelerated Alternating Minimization.
CoRR, 2019

On the Complexity of Approximating Wasserstein Barycenter.
CoRR, 2019

Accelerated Gradient-Free Optimization Methods with a Non-Euclidean Proximal Operator.
Autom. Remote. Control., 2019

Gradient Methods for Problems with Inexact Model of the Objective.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

On the Complexity of Approximating Wasserstein Barycenters.
Proceedings of the 36th International Conference on Machine Learning, 2019

Optimal Tensor Methods in Smooth Convex and Uniformly ConvexOptimization.
Proceedings of the Conference on Learning Theory, 2019

Near Optimal Methods for Minimizing Convex Functions with Lipschitz $p$-th Derivatives.
Proceedings of the Conference on Learning Theory, 2019

On Primal and Dual Approaches for Distributed Stochastic Convex Optimization over Networks.
Proceedings of the 58th IEEE Conference on Decision and Control, 2019

2018
Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm.
Proceedings of the 35th International Conference on Machine Learning, 2018

Distributed Computation of Wasserstein Barycenters Over Networks.
Proceedings of the 57th IEEE Conference on Decision and Control, 2018

2017
Randomized Similar Triangles Method: A Unifying Framework for Accelerated Randomized Optimization Methods (Coordinate Descent, Directional Search, Derivative-Free Method).
CoRR, 2017

2016
Stochastic Intermediate Gradient Method for Convex Problems with Stochastic Inexact Oracle.
J. Optim. Theory Appl., 2016

Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 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

Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints.
Proceedings of the Discrete Optimization and Operations Research, 2016

2015
Primal-Dual Methods for Solving Infinite-Dimensional Games.
J. Optim. Theory Appl., 2015


  Loading...