Linear programming with online learning
From MaRDI portal
Publication:2465950
DOI10.1016/J.ORL.2006.10.008zbMATH Open1149.90097OpenAlexW2003131102MaRDI QIDQ2465950FDOQ2465950
Authors: Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail Nediak 
Publication date: 11 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2006.10.008
Recommendations
- Efficient online linear optimization with approximation algorithms
- Online learning and online convex optimization
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds
- Online linear optimization over permutations
- A dynamic near-optimal algorithm for online linear programming
- On-line learning of linear functions
- scientific article; zbMATH DE number 1003270
- Scale-free algorithms for online linear optimization
- scientific article; zbMATH DE number 1950582
- On-line learning with linear loss constraints.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online algorithms. The state of the art
- Robust solutions of uncertain linear programs
- Adaptive game playing using multiplicative weights
- Linear programming under uncertainty
- Universal Portfolios
- Tracking the best expert
- How to use expert advice
- Title not available (Why is that?)
- Derandomizing stochastic prediction strategies
- Efficient algorithms for online decision problems.
- On-line learning and the metrical task system problem
- Linear programming with online learning
Cited In (5)
This page was built for publication: Linear programming with online learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465950)
