Mirror descent and constrained online optimization problems

DOI10.1007/978-3-030-10934-9_5zbMath1468.90089arXiv1809.08329OpenAlexW2963377030MaRDI QIDQ2026150

Mohammad S. Alkousa, Fedor S. Stonyakin, Alexander V. Gasnikov, Alexander A. Titov

Publication date: 18 May 2021

Full work available at URL: https://arxiv.org/abs/1809.08329

zbMATH Keywords

unit simplexonline convex optimizationnon-smooth constrained optimizationadaptive mirror descentnon-Euclidean prox-structure

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (3)

Analogues of Switching Subgradient Schemes for Relatively Lipschitz-Continuous Convex Programming Problems ⋮ Adaptive Mirror Descent Algorithms for Convex and Strongly Convex Optimization Problems with Functional Constraints ⋮ On Modification of an Adaptive Stochastic Mirror Descent Algorithm for Convex Optimization Problems with Functional Constraints

This page was built for publication: Mirror descent and constrained online optimization problems