Gradient methods for problems with inexact model of the objective
From MaRDI portal
Publication:2181750
DOI10.1007/978-3-030-22629-9_8zbMath1437.90126arXiv1902.09001OpenAlexW2955862560MaRDI QIDQ2181750
Alexander V. Gasnikov, Pavel Dvurechensky, Artem Agafonov, Darina Dvinskikh, Alexey Kroshnin, Olesya Kuznetsova, César A. Uribe, Dmitry Pasechnyuk, Fedor S. Stonyakin, Alexander Tyurin, Sergei Yu. Artamonov
Publication date: 19 May 2020
Full work available at URL: https://arxiv.org/abs/1902.09001
Related Items (14)
Stochastic approximation versus sample average approximation for Wasserstein barycenters ⋮ Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle ⋮ Stochastic saddle-point optimization for the Wasserstein barycenter problem ⋮ First-order methods for convex optimization ⋮ Unifying framework for accelerated randomized methods in convex optimization ⋮ Accelerated and unaccelerated stochastic gradient descent in model generality ⋮ Recent theoretical advances in decentralized distributed convex optimization ⋮ Recent Theoretical Advances in Non-Convex Optimization ⋮ An accelerated directional derivative method for smooth stochastic convex optimization ⋮ Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems ⋮ Inexact model: a framework for optimization and variational inequalities ⋮ Universal intermediate gradient method for convex problems with inexact oracle ⋮ Network manipulation algorithm based on inexact alternating minimization ⋮ Convex optimization with inexact gradients in Hilbert space and applications to elliptic inverse problems
This page was built for publication: Gradient methods for problems with inexact model of the objective
