Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference25 articles.
1. Anstreicher, K.M., Burer, S.: Computable representations for convex hulls of low-dimensional quadratic forms. Math. Program. Ser. B 124, 33–43 (2010)
2. Bao, X., Sahinidis, N.V., Tawarmalani, M.: Semidefinite relaxation for quadratically constrained quadratic programming: a review and comparisons. Math. Program. Ser. B 129(1), 129–157 (2011)
3. Berman, A., Shaked-Monderer, N.: Completely Positive Matrices. World Scientific, London (2003)
4. Bienstock, D.: A note on polynomial solvability of the cdt problem. Preprint, Department of Industrial Engineering and Operations Research, Columbia University, New York, NY. Revised 2014. Submitted (2013)
5. Bienstock D., Michalka A.: Polynomial solvability of variants of the trust-region subproblem. In: Proceedings of the 25th ACM–SIAM symposium on discrete algorithms (SODA 2014), pp. 380–390, (2014)
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献