Strong convexity of feasible sets in off-line and online optimization
Year of publication: |
2023
|
---|---|
Authors: | Molinaro, Marco |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 48.2023, 2, p. 865-884
|
Subject: | convex geometry | convex optimization | follow the leader | online learning | online linear optimization | strongly convex sets | uniform convexity | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Local convergence of tensor methods
Doikov, Nikita, (2019)
-
Efficient online linear optimization with approximation algorithms
Garber, Dan, (2021)
-
Bandits with global convex constraints and objective
Agrawal, Shipra, (2019)
- More ...
-
Characterization of the split closure via geometric lifting
Basu, Amitabh, (2015)
-
Some lower bounds on sparse outer approximations of polytopes
Dey, Santanu S., (2015)
-
Lifting Gomory cuts with bounded variables
Cornuéjols, Gérard, (2013)
- More ...