activity
20182025
most citedSolving strongly convex-concave composite saddle point problems with a small dimension of one of the variables

2 citations · 7 across the 20 of their papers we have counts for

collaborators
Showing 2023Show all

5 papers · 1 filter

math.OC2023

Algorithms for Euclidean-regularised Optimal Transport

Dmitry A. Pasechnyuk, Michael Persiianov, Pavel Dvurechensky +1

This paper addresses the Optimal Transport problem, which is regularized by the square of Euclidean -norm. It offers theoretical guarantees regarding the iteration complexi…

math.OC2023★ 1 cited

Primal-Dual Gradient Methods for Searching Network Equilibria in Combined Models with Nested Choice Structure and Capacity Constraints

Meruza Kubentayeva, Demyan Yarmoshik, Mikhail Persiianov +8

We consider a network equilibrium model (i.e. a combined model), which was proposed as an alternative to the classic four-step approach for travel forecasting in transportation net…

math.AT2023

Applying language models to algebraic topology: generating simplicial cycles using multi-labeling in Wu's formula

Kirill Brilliantov, Fedor Pavutnitskiy, Dmitry Pasechnyuk +1

Computing homotopy groups of spheres has long been a fundamental objective in algebraic topology. Various theoretical and algorithmic approaches have been developed to tackle this…

math.OC2023

A randomised non-descent method for global optimisation

Dmitry A. Pasechnyuk, Alexander Gornov

This paper proposes novel algorithm for non-convex multimodal constrained optimisation problems. It is based on sequential solving restrictions of problem to sections of feasible s…

cs.SE2023★ 1 cited

Judging Adam: Studying the Performance of Optimization Methods on ML4SE Tasks

Dmitry Pasechnyuk, Anton Prazdnichnykh, Mikhail Evtikhiev +1

Solving a problem with a deep learning model requires researchers to optimize the loss function with a certain optimization method. The research community has developed more than a…