Stochastic incremental mirror descent algorithms with Nesterov smoothing

DOI10.1007/s11075-023-01574-1OpenAlexW3215035873MaRDI QIDQ6145577

Sandy Bitterlich, Sorin-Mihai Grad

Publication date: 9 January 2024

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-023-01574-1

zbMATH Keywords

stochasticmirror descentNesterov smoothing

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical solutions to stochastic differential and integral equations (65C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Primal-dual subgradient methods for convex problems
• Smooth minimization of non-smooth functions
• Adaptive smoothing algorithms for nonsmooth composite convex minimization
• A version of the mirror descent method to solve variational inequalities
• Lectures on convex optimization
• Stochastic mirror descent dynamics and their convergence in monotone variational inequalities
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Inexact stochastic mirror descent for two-stage nonlinear stochastic programs
• Fastest rates for stochastic mirror descent methods
• Variable smoothing for convex optimization problems using stochastic gradients
• Optimal subgradient methods: computational properties for large-scale linear inverse problems
• Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization
• A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality
• The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography
• Smoothing and First Order Methods: A Unified Framework
• Duality Between Subgradient and Conditional Gradient Methods
• MAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite Minimization
• First-Order Methods in Optimization
• Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent
• Ergodic Mirror Descent
• Analogues of Switching Subgradient Schemes for Relatively Lipschitz-Continuous Convex Programming Problems
• On Stochastic Subgradient Mirror-Descent Algorithm with Weighted Averaging
• Smoothing techniques and difference of convex functions algorithms for image reconstructions
• Convex Analysis
• On the Convergence of Mirror Descent beyond Stochastic Convex Programming
• Unifying mirror descent and dual averaging

This page was built for publication: Stochastic incremental mirror descent algorithms with Nesterov smoothing