1. Abernethy, J., Warmuth, M. K., & Yellin, J. (2008). When random play is optimal against an adversary. In Proceedings of the 21st annual conference on learning theory (COLT ’08) (pp. 437–445).
2. Agarwal, A., Hazan, E., Kale, S., & Schapire, R. E. (2006). Algorithms for portfolio management based on the Newton method. In Proceedings of the 23rd international conference on machine learning (ICML ’06) (pp. 9–16). New York: ACM. http://doi.acm.org/10.1145/1143844.1143846 .
3. Arora, S., & Kale, S. (2007). A combinatorial, primal-dual approach to semidefinite programs. In Proceedings of the 39th annual ACM symposium on theory of computing (STOC ’07) (pp. 227–236). New York: ACM.
4. Arora, S., Hazan, E., & Kale, S. (2005). Fast algorithms for approximate semidefinite programming using the multiplicative weights update method. In 46th annual symposium on foundations of computer science (FOCS ’05) (pp. 339–348).
5. Bernstein, D. S. (2005). Matrix mathematics: theory, facts, and formulas with application to linear systems theory. Princeton: Princeton University Press.