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 | Nichtlineare Optimierung | Nonlinear programming |
-
Finite dimensional convexity and optimization
Florenzano, Monique, (2001)
-
Convex optimization for bundle size pricing problem
Li, Xiaobo, (2022)
-
Patriksson, Michael, (2015)
- More ...
-
Characterization of the split closure via geometric lifting
Basu, Amitabh, (2015)
-
Cutting planes from two-term disjunctions
Bonami, Pierre, (2013)
-
Lifting Gomory cuts with bounded variables
Cornuéjols, Gérard, (2013)
- More ...