Fetching the paper…
Reading the bibliography…
We extend the Frank-Wolfe (FW) optimization algorithm to solve constrained smooth convex-concave saddle point (SP) problems.
Theory of games and economic behavior
J. Von Neumann and O. Morgenstern · 1944
Earlier work this paper cites.
Iterative solution of games by fictitious play
G. Brown · 1951
Earlier work this paper cites.
An iterative method of solving a game
J. Robinson · 1951
Earlier work this paper cites.
An algorithm for quadratic programming
M. Frank and P. Wolfe · 1956
Earlier work this paper cites.
Note on a computation method in the theory of games
H. N. Shapiro · 1958
Earlier work this paper cites.
Mathematical methods and theory in games, programming and economics, 1960
S. Karlin · 1960
Earlier work this paper cites.
Paths, trees and flowers
J. Edmonds · 1965
Earlier work this paper cites.
Constrained minimization methods
E. S. Levitin and B. T. Polyak · 1966
Earlier work this paper cites.
Existence theorems and convergence of minimizing sequences in extremum problems with restrictions
B. T. Polyak · 1966
Earlier work this paper cites.
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
A. Viterbi · 1967
Earlier work this paper cites.
Approximate methods in optimization problems
V. F. Demyanov and A. M. Rubinov · 1970
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
G. Korpelevich · 1976
Earlier work this paper cites.
Rates of convergence for conditional gradient algorithms near singular and nonsingular extremals
J. C. Dunn · 1979
Earlier work this paper cites.
On the computational complexity of Ising spin glass models
F. Barahona · 1982
Earlier work this paper cites.
Strong and weak convexity of sets and functions
J.-P. Vial · 1983
Earlier work this paper cites.
Solving asymmetric variational inequality problems and systems of equations with generalized nonlinear programming algorithms
J. H. Hammond · 1984
Earlier work this paper cites.
Some comments on Wolfe’s ‘away step’
J. Guélat and P. Marcotte · 1986
Cited alongside, same era.
Convex analysis and minimization algorithms I: Fundamentals
J.-B. Hiriart-Urruty and C. Lemaréchal · 1993
Cited alongside, same era.
Fast algorithms for finding randomized strategies in game trees
D. Koller, N. Megiddo, and B. Von Stengel · 1994
Cited alongside, same era.
A class of gap functions for variational inequalities
T. Larsson and M. Patriksson · 1994
Cited alongside, same era.
Convergence properties of feasible descent methods for solving variational inequalities in banach spaces
D. L. Zhu and P. Marcotte · 1998
Cited alongside, same era.
Nonlinear Programming and Variational Inequality Problems: A Unified Approach
M. Patriksson · 1999
Cited alongside, same era.
Optimization with sparsity-inducing penalties
F. Bach, R. Jenatton, J. Mairal, and G. Obozinski · 2012
Later among the works it cites.
Revisiting Frank-Wolfe: Projection-free sparse convex optimization
M. Jaggi · 2013
Later among the works it cites.
Block-coordinate Frank-Wolfe optimization for structural SVMs
S. Lacoste-Julien, M. Jaggi, M. Schmidt, and P. Pletscher · 2013
Later among the works it cites.
The complexity of large-scale convex programming under a linear optimization oracle
G. Lan · 2013
Later among the works it cites.
An affine invariant linear convergence analysis for Frank-Wolfe algorithms
S. Lacoste-Julien and M. Jaggi · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Max-margin markov networks
B. Taskar, C. Guestrin, and D. Koller · 2003
Cited alongside, same era.
Some recent advances in projection-type methods for variational inequalities
N. Xiu and J. Zhang · 2003
Cited alongside, same era.
Introductory lectures on convex optimization: A basic course , volume 87
Y. Nesterov · 2004
Cited alongside, same era.
Robust Fisher discriminant analysis
S.-J. Kim, A. Magnani, and S. Boyd · 2005
Cited alongside, same era.
Structured prediction, dual extragradient and Bregman projections
B. Taskar, S. Lacoste-Julien, and M. I. Jordan · 2006
Cited alongside, same era.
Nash equilibria in random games
I. Bárány, S. Vempala, and A. Vetta · 2007
Cited alongside, same era.
C. Daskalakis and Q. Pan · 2014
Later among the works it cites.
Generative adversarial nets
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio · 2014
Later among the works it cites.
An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
J. Kelner, Y. Lee, L. Orrechia, and A. Sidford · 2014
Later among the works it cites.
B. Cox, A. Juditsky, and A. Nemirovski · 2015
Later among the works it cites.
Faster rates for the Frank-Wolfe method over strongly-convex sets
D. Garber and E. Hazan · 2015
Later among the works it cites.
Semi-proximal mirror-prox for nonsmooth composite minimization
N. He and Z. Harchaoui · 2015
Later among the works it cites.
On the global linear convergence of Frank-Wolfe optimization variants
S. Lacoste-Julien and M. Jaggi · 2015
Later among the works it cites.
From duels to battlefields: Computing equilibria of Blotto and other games
A. Ahmadinejad, S. Dehghani, Hajiaghayi, B. Lucier, H. Mahini, and S. Seddighin · 2016
Closest in time.
Solving variational inequalities with monotone operators on domains given by linear minimization oracles
A. Juditsky and A. Nemirovski · 2016
Closest in time.
Minding the gaps for block Frank-Wolfe optimization of structured SVMs
A. Osokin, J.-B. Alayrac, I. Lukasewitz, P. K. Dokania, and S. Lacoste-Julien · 2016
Closest in time.