Fast Algorithms for Online Stochastic Convex Programming

DOI10.1137/1.9781611973730.93zbMath1371.90091arXiv1410.7596OpenAlexW2951097138MaRDI QIDQ5363008

Shipra Agrawal, Nikhil R. Devanur

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Convex programming (90C25) Stochastic programming (90C15) Online algorithms; streaming algorithms (68W27)

Related Items (18)

Approximation algorithms for stochastic combinatorial optimization problems ⋮ Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds ⋮ Primal Beats Dual on Online Packing LPs in the Random-Order Model ⋮ Competitive online algorithms for resource allocation over the positive semidefinite cone ⋮ Social welfare and profit maximization from revealed preferences ⋮ Configuration balancing for stochastic requests ⋮ Online allocation and display ads optimization with surplus supply ⋮ Simple and fast algorithm for binary integer and online linear programming ⋮ Unnamed Item ⋮ Bandits with Global Convex Constraints and Objective ⋮ Interior-Point-Based Online Stochastic Bin Packing ⋮ Welfare maximization with production costs: a primal dual approach ⋮ Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts ⋮ Scalable and Jointly Differentially Private Packing ⋮ How the Experts Algorithm Can Help Solve LPs Online ⋮ Autobidding with constraints ⋮ Tractable Equilibria in Sponsored Search with Endogenous Budgets ⋮ Fair Resource Allocation in a Volatile Marketplace

This page was built for publication: Fast Algorithms for Online Stochastic Convex Programming