In this paper, we propose a general algorithmic framework for the first-order methods in
optimization in a broad sense, including minimization problems, saddle-point problems and …

In this paper, we propose new first-order methods for minimization of a convex function on a
simple convex set. We assume that the objective function is a composite function given as a …

In this paper, we propose a general algorithmic framework for first-order methods in
optimization in a broad sense, including minimization problems, saddle-point problems, and …

We introduce an inexact oracle model for variational inequalities (VI) with monotone
operator, propose a numerical method which solves such VI's and analyze its convergence …

This chapter is devoted to the blackbox subgradient algorithms with the minimal
requirements for the storage of auxiliary results, which are necessary to execute these …

In this paper, we propose new first-order methods for minimization of a convex function on a
simple convex set. We assume that the objective function is a composite function given as a …

Recently saddle-point problems and variational inequalities (VI's) gained a new interest in
the deep learning community, eg in application to Generative Adversary Networks. We …

[97] AV Gasnikov, PE Dvurechensky, ME Zhukovskii, SV Kim, SS Plaunov, DA Smirnov, and
FA Noskov. About the power law of the pagerank vector component distribution. part 2. the …

Підвищення ефективності суспільного виробництва пов'язано, перш за все, з розвитком
машинобудування та широким впровадженням у виробництво прогресивних технологій …