Alternating minimization (AM) procedures are practically efficient in many applications for
solving convex and non-convex optimization problems. On the other hand, Nesterov's …

In this paper, we present a generic framework that allows accelerating almost arbitrary non-
accelerated deterministic and randomized algorithms for smooth convex optimization …

In this paper we study the smooth strongly convex minimization problem $\min_ {x}\min_y f
(x, y) $. The existing optimal first-order methods require $\mathcal {O}(\sqrt {\max\{\kappa_x …

This paper considers a 1D time-domain inverse scattering problem for the Helmholtz
equation in which penetrable scatterers are to be determined from boundary measurements …

Данное пособие написано по материалам лекций, прочитанных автором в летней
школе «Современная математика» в Ратмино (г. Дубна) в июле 2017 г. Идея курса …

Optimization can be considered as the fundament of many areas of applied mathematics,
engineering, computer science, and a number of other scientific disciplines [77]. But …