Solving optimization problems with Blackwell approachability
Year of publication: |
2024
|
---|---|
Authors: | Grand-Clément, Julien ; Kroer, Christian |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 49.2024, 2, p. 697-728
|
Subject: | Blackwell approachability | no-regret algorithm | parameter-free algorithm | saddle point | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Online learning via offline greedy algorithms : applications in market design and optimization
Niazadeh, Rad, (2023)
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
A polyhedral description of kernels
Chen, Qin, (2016)
- More ...
-
Robust Markov decision processes : beyond rectangularity
Goyal, Vineet, (2023)
-
Robustness of proactive intensive care unit transfer policies
Grand-Clément, Julien, (2023)
-
A first-order approach to accelerated value iteration
Goyal, Vineet, (2023)
- More ...