> Details

Stonyakin, Fedor [Author]; Dvinskikh, Darina [Author]; Dvurechensky, Pavel [Author]; Kroshnin, Alexey [Author]; Kuznetsova, Olesya [Author]; Agafonov, Artem [Author]; Gasnikov, Alexander [Author]; Tyurin, Alexander [Author]; Uribe, Cesar A. [Author]; Pasechnyuk, Dmitry [Author]; Artamonov, Sergei [Author]

Gradient methods for problems with inexact model of the objective

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: E-Book; Report; Text
  • Title: Gradient methods for problems with inexact model of the objective
  • Contributor: Stonyakin, Fedor [Author]; Dvinskikh, Darina [Author]; Dvurechensky, Pavel [Author]; Kroshnin, Alexey [Author]; Kuznetsova, Olesya [Author]; Agafonov, Artem [Author]; Gasnikov, Alexander [Author]; Tyurin, Alexander [Author]; Uribe, Cesar A. [Author]; Pasechnyuk, Dmitry [Author]; Artamonov, Sergei [Author]
  • imprint: Weierstrass Institute for Applied Analysis and Stochastics publication server, 2020
  • Language: English
  • DOI: https://doi.org/10.20347/WIAS.PREPRINT.2688
  • Keywords: 90C25 ; article ; 90C30 ; Gradient method -- inexact oracle -- strong convexity -- relative smoothness -- Bregman divergence ; 68Q25
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: We consider optimization methods for convex minimization problems under inexact information on the objective function. We introduce inexact model of the objective, which as a particular cases includes inexact oracle [19] and relative smoothness condition [43]. We analyze gradient method which uses this inexact model and obtain convergence rates for convex and strongly convex problems. To show potential applications of our general framework we consider three particular problems. The first one is clustering by electorial model introduced in [49]. The second one is approximating optimal transport distance, for which we propose a Proximal Sinkhorn algorithm. The third one is devoted to approximating optimal transport barycenter and we propose a Proximal Iterative Bregman Projections algorithm. We also illustrate the practical performance of our algorithms by numerical experiments.
  • Access State: Open Access