Author:
Yasutake Shota,Hatano Kohei,Kijima Shuji,Takimoto Eiji,Takeda Masayuki
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)
2. Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Physics 7, 200–217 (1967)
3. Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press (2006)
4. Fujishige, S.: Submodular functions and optimization, 2nd edn. Elsevier Science (2005)
5. Hazan, E.: A survey: The convex optimization approach to regret minimization (2009),
http://www.cs.princeton.edu/~ehazan/papers/OCO-survey.pdf
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献