1. Abernethy, J., Bartlett, P.L., Rakhlin, A., Tewari, A.: Optimal strategies and minimax lower bounds for online convex games. In: Proceedings of the 19th Annual Conference on Computational Learning Theory (2008)
2. Ahmadi, H., Shanbhag, U.V.: Data-driven first-order methods for misspecified convex optimization problems: global convergence and rate estimates. In: 53rd IEEE Conference on Decision and Control, pp. 4228–4233 (2014)
3. Andrew, L.L., Barman, S., Ligett, K., Lin, M., Meyerson, A., Roytman, A., Wierman, A.: A tale of two metrics: simultaneous bounds on competitiveness and regret. J. Mach. Learn. Res.: Workshop Conf. Proc. 30, 741–763 (2013)
4. Ben-Tal, A., Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton Series in Applied Mathematics. Princeton University Press, Princeton (2009)
5. Ben-Tal, A., Hazan, E., Koren, T., Mannor, S.: Oracle-based robust optimization via online learning. Oper. Res. 63(3), 628–638 (2015)