Stochastic incremental mirror descent algorithms with Nesterov smoothing

Sandy Bitterlich, Sorin Mihai Grad

Research output: Contribution to journalArticlepeer-review

Abstract

For minimizing a sum of finitely many proper, convex and lower semicontinuous functions over a nonempty closed convex set in an Euclidean space we propose a stochastic incremental mirror descent algorithm constructed by means of the Nesterov smoothing. Further, we modify the algorithm in order to minimize over a nonempty closed convex set in an Euclidean space a sum of finitely many proper, convex and lower semicontinuous functions composed with linear operators. Next, a stochastic incremental mirror descent Bregman-proximal scheme with Nesterov smoothing is proposed in order to minimize over a nonempty closed convex set in an Euclidean space a sum of finitely many proper, convex and lower semicontinuous functions and a prox-friendly proper, convex and lower semicontinuous function. Different to the previous contributions from the literature on mirror descent methods for minimizing sums of functions, we do not require these to be (Lipschitz) continuous or differentiable.

Original languageEnglish
Pages (from-to)351-382
Number of pages32
JournalNumerical Algorithms
Volume95
Issue number1
DOIs
Publication statusPublished - 1 Jan 2024

Keywords

  • Incremental algorithm
  • Location problem
  • Mirror descent method
  • Nesterov smoothing
  • PET image reconstructions
  • Proximal point algorithm
  • Stochastic algorithm

Fingerprint

Dive into the research topics of 'Stochastic incremental mirror descent algorithms with Nesterov smoothing'. Together they form a unique fingerprint.

Cite this