Fetching the paper…
Reading the bibliography…
We study the Quantum Approximate Optimization Algorithm (QAOA) in the context of the Max-Cut problem.
W. Karush, Minima of functions of several variables with inequalities as side conditions , Master’s thesis, University of Chicago (1939)
1939
Earlier work this paper cites.
H. W. Kuhn and A. W. Tucker, Nonlinear programming, in Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability (University of California Press, Berkeley, Calif., 1951) pp. 481–492
1951
Earlier work this paper cites.
W. Feller, An Introduction to Probability Theory and Its Applications , 3rd ed., Vol. 2 (Wiley, Hoboken, New Jersey, 1971)
1971
Earlier work this paper cites.
R. M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations (Springer US, Boston, MA, 1972) pp. 85–103
1972
Earlier work this paper cites.
R. Fletcher, Practical Methods of Optimization (2nd edition) (John Wiley and Sons, New York, NY, USA, 1987)
1987
Earlier work this paper cites.
C. Delorme and S. Poljak, Laplacian eigenvalues and the maximum cut problem, Mathematical Programming 62
1993
Earlier work this paper cites.
M. Powell, A direct search optimization method that models the objective and constraint functions by linear interpolation, Advances in Optimization and Numerical Analysis 275
1994
Earlier work this paper cites.
Y. Nesterov and A. Nemirovski, Interior-point polynomial algorithms in convex programming (SIAM, Philadelphia, PA, USA, 1994)
1994
Earlier work this paper cites.
M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of the ACM (JACM) 42
1995
Earlier work this paper cites.
S. Poljak and F. Rendl, Nonpolyhedral relaxations of graph-bisection problems, SIAM Journal on Optimization 5
1995
Earlier work this paper cites.
A. I. Barvinok, Problems of distance geometry and convex properties of quadratic maps, Discrete & Computational Geometry 13
1995
Earlier work this paper cites.
G. Pataki, On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues, Mathematics of Operations Research 23
1998
Earlier work this paper cites.
L. Trevisan, G. B. Sorkin, M. Sudan, and D. P. Williamson, Gadgets, approximation, and linear programming, SIAM Journal on Computing 29
2000
Earlier work this paper cites.
J. Håstad, Some optimal inapproximability results, Journal of the ACM (JACM) 48
2001
Earlier work this paper cites.
S. Burer, R. D. C. Monteiro, and Y. Zhang, Rank-2 relaxation heuristics for Max-Cut and other binary quadratic programs, SIAM Journal on Optimization 12
2001
Earlier work this paper cites.
S. Khot, On the power of unique 2-prover 1-round games, in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002) pp. 767–775
2002
Earlier work this paper cites.
S. Burer and R. D. Monteiro, A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, Mathematical Programming 95
2003
Earlier work this paper cites.
M. Charikar and A. Wirth, Maximizing quadratic programs: extending grothendieck’s inequality, in 45th Annual IEEE Symposium on Foundations of Computer Science (2004) pp. 54–60
2004
Earlier work this paper cites.
E. Mossel, R. O’Donnell, and K. Oleszkiewicz, Noise stability of functions with low influences: invariance and optimality, in 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05) (IEEE, 2005) pp. 21–30
2005
Cited alongside, same era.
S. Burer and R. D. Monteiro, Local minima and convergence in low-rank semidefinite programming, Mathematical Programming 103
2005
Cited alongside, same era.
T. Ralphs and M. Güzelsoy, Duality and warm starting in integer programming, in Proceedings of 2006 NSF Design, Service, and Manufacturing Grantees and Research Conference (2006)
2006
Cited alongside, same era.
S. Khot, G. Kindler, E. Mossel, and R. O’Donnell, Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?, SIAM Journal on Computing 37
2007
Cited alongside, same era.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2008
Cited alongside, same era.
F. Gao and L. Han, Implementing the nelder-mead simplex algorithm with adaptive parameters, Computational Optimization and Applications 51
2012
Cited alongside, same era.
2014
Cited alongside, same era.
D. Bertsimas, A. King, and R. Mazumder, Best subset selection via a modern optimization lens, The Annals of Statistics 44
2016
Cited alongside, same era.
2017
Cited alongside, same era.
2017
Cited alongside, same era.
R. Lyons and Y. Peres, Probability on trees and networks , Vol. 42 (Cambridge University Press, 2017)
2017
Cited alongside, same era.
J. Preskill, Quantum computing in the NISQ era and beyond, Quantum 2
2018
Cited alongside, same era.
2019
Later among the works it cites.
2020
Closest in time.
T. Marcucci and R. Tedrake, Warm start of mixed-integer programs for model predictive control of hybrid systems, IEEE Transactions on Automatic Control 10.1109/TAC.2020.3007688 (2020)
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
N. Boumal, V. Voroninski, and A. S. Bandeira, Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs, Communications on Pure and Applied Mathematics 73
2020
Closest in time.
2020
Closest in time.
The Sage Developers, SageMath, the Sage Mathematics Software System (2020), https://www.sagemath.org
2020
Closest in time.
2021
Closest in time.
2021
Closest in time.
M. Wilson, R. Stromswold, F. Wudarski, S. Hadfield, N. M. Tubman, and E. G. Rieffel, Optimizing quantum heuristics with meta-learning, Quantum Machine Intelligence 3
2021
Closest in time.
R. Herrman, L. Treffert, J. Ostrowski, P. C. Lotshaw, T. S. Humble, and G. Siopsis, Impact of graph structures for qaoa on maxcut, Quantum Information Processing 20
2021
Closest in time.