Linear programming with online learning
From MaRDI portal
Publication:2465950
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
- scientific article; zbMATH DE number 1656903 (Why is no real title available?)
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- Adaptive game playing using multiplicative weights
- Derandomizing stochastic prediction strategies
- Efficient algorithms for online decision problems.
- How to use expert advice
- Linear programming under uncertainty
- Linear programming with online learning
- On-line learning and the metrical task system problem
- Online algorithms. The state of the art
- Robust solutions of uncertain linear programs
- Tracking the best expert
- Universal Portfolios
Cited in
(5)- Linear programming with online learning
- scientific article; zbMATH DE number 1003270 (Why is no real title available?)
- Online learning with sample path constraints
- scientific article; zbMATH DE number 5957487 (Why is no real title available?)
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds
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)
