1. Introduction to Optimization;Polyak,1987
2. The Nature of Statistical Learning Theory;Vapnik,2000
3. M. Zinkevich, Online convex programming and generalized infinitesimal gradient ascent, in: Proceedings of the International Conference on Machine Learning, ICML, 2003, pp. 928–936.
4. S.M. Kakade, A. Tewari, On the generalization ability of online strongly convex programming algorithms, in: Proceedings of the Neural Information Processing Systems (NIPS), Vancouver, BC, Canada, 2008, pp. 801–808.
5. E. Hazan, S. Kale, Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly convex optimization, in: Proceedings of the Conference on Learning Theory (COLT), 2011, pp. 1–12.