Constrained Online Convex Optimization on COCO
7CCVGarber and Kretzu
Evaluation results
| Method | Links | ||
|---|---|---|---|
| Garber and KretzuComplexity per round=LP, Assumptions=—2025.01 | 7 | 3 | |
| Garber and KretzuComplexity per round=Conv-OPT, Assumptions=—2025.01 | 7 | 3 | |
| Mahdavi et al.Complexity per round=Proj., Assumptions=Fixed Constraints2025.01 | 3 | — | |
| Guo et al.Complexity per round=Conv-OPT, Assumptions=—2025.01 | 3 | — | |
| Wang et al.Complexity per round=LP, Assumptions=Use of doubling trick2025.01 | 3 | 3 | |
| This paperComplexity per round=LP, Assumptions=—2025.01 | 3 | 3 | |
| Jenatton et al.Complexity per round=Proj, Assumptions=Fixed Constraints2025.01 | 1 | 1 | |
| Yu and NeelyComplexity per round=Conv-OPT, Assumptions=Slater & Fixed Constraints2025.01 | 1 | — | |
| Yi et al.Complexity per round=Conv-OPT, Assumptions=Fixed Constraints2025.01 | 1 | — | |
| Yi et al.Complexity per round=Conv-OPT, Assumptions=Slater2025.01 | 1 | 1 |