Quadratic programming with one negative eigenvalue is NP-hard
暂无分享,去创建一个
[1] L. Khachiyan,et al. The polynomial solvability of convex quadratic programming , 1980 .
[2] Katta G. Murty,et al. Some NP-complete problems in linear programming , 1982, Oper. Res. Lett..
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Panos M. Pardalos,et al. Polynomial time algorithms for some classes of constrained nonconvex quadratic problems , 1990 .
[5] J. B. Rosen,et al. Methods for global concave minimization: A bibliographic survey , 1986 .
[6] P. Pardalos,et al. Checking local optimality in constrained quadratic programming is NP-hard , 1988 .
[7] Stephen A. Vavasis,et al. Quadratic Programming is in NP , 1990, Inf. Process. Lett..
[8] Sartaj Sahni,et al. Computationally Related Problems , 1974, SIAM J. Comput..
[9] Panos M. Pardalos,et al. Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.