Decomposition Techniques for Bilinear Saddle Point Problems and Variational Inequalities with Affine Monotone Operators on Domains Given by Linear Minimization Oracles

Frank, M., Wolfe, P. “An algorithm for quadratic programming” – Naval Res. Logist. Q

1956

Earlier work this paper cites.

Bellman, R. “On Colonel Blotto and analogous games” – SIAM Review

1969

Earlier work this paper cites.

Demyanov, V., Rubinov, A. Approximate Methods in Optimization Problems

1970

Earlier work this paper cites.

Dunn, J. C., Harshbarger, S. “Conditional gradient algorithms with open loop step size rules” – Journal of Mathematical Analysis and Applications

1978

Earlier work this paper cites.

Pshenichnyi, B.N., Danilin, Y.M. Numerical Methods in Extremal Problems

1978

Earlier work this paper cites.

Gol’shtein, E.G. “Direct-Dual Block Method of Lnear Programming” – Avtomat. i Telemekh

1996

Earlier work this paper cites.

Gol’shtein, E.G., Sokolov, N.A., Golshtein E.G., Sokolov N.A. ”A decomposition algorithm for solving multicommodity production-and-transportation problem” – Ekonomika i Matematicheskie Metody

1997

Earlier work this paper cites.

Robertson, B. “The Colonel Blotto game” – Economic Theory

2006

Earlier work this paper cites.

Jaggi, M., Sulovsky, M. “A simple algorithm for nuclear norm regularized problems” – In ICML, 2010

2010

Cited alongside, same era.

Nemirovski, A., Onn, S., Rothblum, U., “Accuracy certificates for computational problems with convex structure” – Mathematics of Operations Research

2010

Cited alongside, same era.

Cox, B., “Applications of accuracy certificates for problems with convex structure” (2011) – Ph.D. Thesis, Georgia Institute of Technology https://smartech.gatech.edu/jspui/bitstream/1853/39489/1/cox_bruce_a_201105_phd.pdf

2011

Cited alongside, same era.

Tewari, A., Ravikumar, P. K., Dhillon, I. S. “Greedy algorithms for structurally constrained high dimensional problems” – in: J. Shawe-Taylor, R.S. Zemel, P.L. Bartlett, F. Pereira, and K.Q. Weinberger, Eds., Advances in Neural Information Processing Systems 24

2011

Cited alongside, same era.

Jaggi, M. “Revisiting Frank-Wolfe: Projection-free sparse convex optimization” – In ICML, 2013

2013

Later among the works it cites.

Argyriou, A., Signoretto, M., and Suykens, J. A. K. “Hybrid Conditional Gradient-Smoothing Algorithms with Applications to Sparse and Low Rank Regularization”, in Regularization, Optimization, Kernels, and Support Vector Machines

2014

Later among the works it cites.

Freund, R., Grigas, P. “New Analysis and Results for the Conditional Gradient Method” – Mathematical Programming

2014

Later among the works it cites.

Garber, D., Hazan, E. “Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets” – to appear 32nd International Conference on Machine Learning (ICML 2015), arXiv:1406.1305 (2014)

Original

2014

Later among the works it cites.

Harchaoui, Z., Juditsky, A., Nemirovski, A. “Conditional Gradient Algorithms for Norm-Regularized Smooth Convex Optimization” – Mathematical Programming