D. A. Pasechnyuk

From MaRDI portal
(Redirected from D. A. Pasechnyuk)
D. A. Pasechnyuk Q6039154



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Accelerated Bregman gradient methods for relatively smooth and relatively Lipschitz continuous minimization problems
Russian Mathematical Surveys
2026-03-06Paper
Decentralised convex optimisation with probability-proportional-to-size quantization
EURO Journal on Computational Optimization
2025-12-19Paper
A randomised non-descent method for global optimisation2025-07-15Paper
Algorithms for Euclidean-regularised optimal transport2024-08-16Paper
OPTAMI: Global Superlinear Convergence of High-order Methods
(available as arXiv preprint)
2024-01-01Paper
Accelerated Bregman gradient methods for relatively smooth and relatively Lipschitz continuous minimization problems
(available as arXiv preprint)
2024-01-01Paper
Solving strongly convex-concave composite saddle-point problems with low dimension of one group of variable
Sbornik: Mathematics
2023-10-04Paper
Convergence analysis of stochastic gradient descent with adaptive preconditioning for non-convex and convex functions2023-08-27Paper
Adaptive Methods or Variational Inequalities with Relatively Smooth and Reletively Strongly Monotone Operators2023-08-01Paper
Adaptive Variant of the Frank-Wolfe Algorithm for Convex Optimization Problems2023-07-29Paper
Algorithms for Euclidean-regularised Optimal Transport2023-07-01Paper
Primal-Dual Gradient Methods for Searching Network Equilibria in Combined Models with Nested Choice Structure and Capacity Constraints2023-07-01Paper
Upper bounds on the maximum admissible level of noise in zeroth-order optimisation2023-06-28Paper
Applying language models to algebraic topology: generating simplicial cycles using multi-labeling in Wu's formula2023-06-01Paper
A unified analysis of variational inequality methods: variance reduction, sampling, quantization, and coordinate descent
Computational Mathematics and Mathematical Physics
2023-05-03Paper
A randomised non-descent method for global optimisation2023-03-27Paper
Upper bounds on the maximum admissible level of noise in zeroth-order optimisation
(available as arXiv preprint)
2023-01-01Paper
Applying language models to algebraic topology: generating simplicial cycles using multi-labeling in Wu's formula
(available as arXiv preprint)
2023-01-01Paper
Adaptive Methods or Variational Inequalities with Relatively Smooth and Reletively Strongly Monotone Operators
(available as arXiv preprint)
2023-01-01Paper
Convergence analysis of stochastic gradient descent with adaptive preconditioning for non-convex and convex functions
(available as arXiv preprint)
2023-01-01Paper
A Damped Newton Method Achieves Global $O\left(\frac{1}{k^2}\right)$ and Local Quadratic Convergence Rate2022-10-31Paper
Effects of momentum scaling for SGD2022-10-21Paper
Effects of momentum scaling for SGD
(available as arXiv preprint)
2022-01-01Paper
A Damped Newton Method Achieves Global $O\left(\frac{1}{k^2}\right)$ and Local Quadratic Convergence Rate
(available as arXiv preprint)
2022-01-01Paper
Non-convex optimization in digital pre-distortion of the signal2021-03-18Paper
Accelerated Proximal Envelopes: Application to the Coordinate Descent Method2021-01-12Paper
Accelerated Proximal Envelopes: Application to the Coordinate Descent Method
(available as arXiv preprint)
2021-01-01Paper
Non-convex optimization in digital pre-distortion of the signal
(available as arXiv preprint)
2021-01-01Paper
Solving strongly convex-concave composite saddle point problems with a small dimension of one of the variables2020-10-05Paper
Inexact Relative Smoothness and Strong Convexity for Optimization and Variational Inequalities by Inexact Model2020-01-23Paper
Solving strongly convex-concave composite saddle point problems with a small dimension of one of the variables
(available as arXiv preprint)
2020-01-01Paper
Adaptive Catalyst for Smooth Convex Optimization2019-11-25Paper
Adaptive Mirror Descent for the Network Utility Maximization Problem2019-11-17Paper
Numerical methods for the resource allocation problem in networks2019-09-29Paper
Scheduling strategies for resource allocation in a cellular base station2019-09-15Paper
Scheduling strategies for resource allocation in a cellular base station
(available as arXiv preprint)
2019-01-01Paper
Adaptive Mirror Descent for the Network Utility Maximization Problem
(available as arXiv preprint)
2019-01-01Paper
Inexact Model: A Framework for Optimization and Variational Inequalities
(available as arXiv preprint)
2019-01-01Paper
Numerical methods for the resource allocation problem in networks
(available as arXiv preprint)
2019-01-01Paper
One Method for Minimization a Convex Lipschitz-Continuous Function of 2 Variables on a Fixed Square2018-12-26Paper
One Method for Minimization a Convex Lipschitz-Continuous Function of 2 Variables on a Fixed Square
(available as arXiv preprint)
2018-01-01Paper


Research outcomes over time


This page was built for person: D. A. Pasechnyuk