Funder
National Natural Science Foundation of China
Beijing Natural Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research
Reference100 articles.
1. 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, 453–476 (2013)
2. Hendrickx, J.M., Olshevsky, A.: Matrix $$p$$-norms are NP-hard to approximate if $$p\ne 1,2,\infty $$. SIAM J. Matrix Anal. Appl. 31(5), 2802–2812 (2009)
3. Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120(2), 479–495 (2009)
4. Murty, K.G., Kabdai, S.N.: Some NP-complete problems in quadratic and linear programming. Math. Program. 39, 117–129 (1987)
5. Ben-Tal, A., Teboulle, M.: Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math. Program. 72, 51–63 (1996)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献