Funder
Defense Advanced Research Projects Agency
Directorate for Engineering
Alfred P. Sloan Foundation
Google
Air Force Office of Scientific Research
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference33 articles.
1. Ahmadi, A.A., Hall, G.: DC decomposition of nonconvex polynomials with algebraic techniques. Math. Program. 169, 69–94 (2015)
2. Ahmadi, A.A., Olshevsky, A., Parrilo, P.A., Tsitsiklis, J.N.: NP-hardness of deciding convexity of quartic polynomials and related problems. Math. Program. 137(1–2), 453–476 (2013)
3. Andronov, V., Belousov, E., Shironin, V.: On solvability of the problem of polynomial programming. Izvestija Akadem. Nauk SSSR Tekhnicheskaja Kibernetika 4, 194–197 (1982)
4. Bajbar, T., Behrends, S.: How fast do coercive polynomials grow? Technical report, Instituts für Numerische und Angewandte Mathematik, Georg-August-Universität Göttingen (2017)
5. Bajbar, T., Stein, O.: Coercive polynomials and their Newton polytopes. SIAM J. Optim. 25(3), 1542–1570 (2015)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献