Stochastic incremental mirror descent algorithms with Nesterov smoothing (Q6145577)
From MaRDI portal
scientific article; zbMATH DE number 7785651
Language | Label | Description | Also known as |
---|---|---|---|
English | Stochastic incremental mirror descent algorithms with Nesterov smoothing |
scientific article; zbMATH DE number 7785651 |
Statements
Stochastic incremental mirror descent algorithms with Nesterov smoothing (English)
0 references
9 January 2024
0 references
This paper presents two incremental stochastic mirror descent algorithms for minimizing sums of finitely many non-smooth convex functions over convex sets. The Nesterov smoothing technique is used for the gradients of the smooth summands of the objective function instead of their subgradients. The functions are not required to be Lipschitz continuous or differentiable. Three algorithms are considered including an optimization problem in classifying images using support vector machines, a problem in tomography and a continuous location problem.
0 references
stochastic
0 references
mirror descent
0 references
Nesterov smoothing
0 references
0 references
0 references
0 references
0 references
0 references
0 references