activity
20052026
most citedAlgorithmic Complexity Bounds on Future Prediction Errors

10 citations · 62 across the 21 of their papers we have counts for

collaborators
Showing math.OCShow all

5 papers · 1 filter

math.OC2023★ 1 cited

Using a one-dimensional finite-element approximation of Webster's horn equation to estimate individual ear canal acoustic transfer from input impedances

Nick Wulbusch, Reinhild Roden, Alexey Chernov +1

In many applications, knowledge of the sound pressure transfer to the eardrum is important. The transfer is highly influenced by the shape of the ear canal and its acoustic propert…

math.OC2016

Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints

Alexey Chernov, Pavel Dvurechensky, Alexander Gasnikov

In this paper we consider a class of optimization problems with a strongly convex objective function and the feasible set given by an intersection of a simple convex set with a set…

math.OC2016★ 2 cited

Dual approaches to the strongly convex simple function minimization problem under affine restrictions

Anton Anikin, Alexander Gasnikov, Pavel Dvurechensky +2

We consider strongly convex optimization problems with affine-type restrictions. We build dual problem and solve dual problem by Fast Gradient Method. We use primal-dual structure…

math.OC2015★ 7 cited

Universal method with inexact oracle and its applications for searching equillibriums in multistage transport problems

Alexander Gasnikov, Pavel Dvurechensky, Dmitry Kamzolov +5

In this paper we propose a new efficient approach for numerical calculation of equillibriums in multistage transport problems. In the very core of our approach lies the proper comb…

math.OC2014★ 1 cited

Entropy linear programming

Alexander Gasnikov, Evgenia Gasnikova, Yurii Nesterov +1

We propose an efficient dual algorithm for ELP based on Fast Gradient Method. The basic idea - to solve properly regularized dual problem.