A tight lower bound for online convex optimization with switching costs

DOI10.1007/978-3-319-89441-6_13zbMath1504.68287OpenAlexW2795096513MaRDI QIDQ1644937

Kevin Schewior, Antonios Foivos Antoniadis

Publication date: 22 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-89441-6_13

Mathematics Subject Classification ID

Convex programming (90C25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Nested convex bodies are chaseable ⋮ Unnamed Item ⋮ Online multistage subset maximization problems ⋮ Algorithms for energy conservation in heterogeneous data centers ⋮ Algorithms for energy conservation in heterogeneous data centers

This page was built for publication: A tight lower bound for online convex optimization with switching costs