Strong Convexity of Feasible Sets in Off-line and Online Optimization

DOI10.1287/moor.2022.1285arXiv2002.03213MaRDI QIDQ6199275

Marco Molinaro

Publication date: 23 February 2024

Published in: Mathematics of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

convex optimizationonline learninguniform convexityconvex geometryonline linear optimizationstrongly convex setsfollow the leader

Mathematics Subject Classification ID

Convex programming (90C25) Convexity and finite-dimensional Banach spaces (including special norms, zonoids, etc.) (aspects of convex geometry) (52A21) Approximation by convex sets (52A27)

This page was built for publication: Strong Convexity of Feasible Sets in Off-line and Online Optimization