1. On copositive programming and standard quadratic optimization problems / I. M. Bomze [et al.] // J. Global Optim. – 2000. – Vol. 18, № 4. – P. 301–320. https://doi.org/10.1023/a:1026583532263
2. Bomze, I. M. Copositive optimization – Recent developments and applications / I. M. Bomze // Eur. J. Operational Research. – 2012. – Vol. 216, № 3. – P. 509–520. https://doi.org/10.1016/j.ejor.2011.04.026
3. Dür, М. Copositive Programming – a Survey / M. Dür // Recent advances in Optimization and its applications in Engineering / M. Diehl [et al.]. – Berlin; Heidelberg: Springer-Verlag, 2010. – P. 3–20. https://doi.org/10.1007/978-3-642-12598-0_1
4. Strong duality for Semidefinite Programming / V. Motakuri [et al.] // SIAM J. Optim. – 1997. – Vol. 7, № 3. – P. 641– 662. https://doi.org/10.1137/s1052623495288350
5. Zhang, Q. Duality formulations in Semidefinite Programming / Q. Zhang, G. Chen, T. Zhang // J. Ind. Manag. Optimiz. – 2010. – Vol. 6, № 4. – P. 881–893. https://doi.org/10.3934/jimo.2010.6.881
6. Kostyukova, O. I. Optimality conditions for Linear Copositive Programming problems with isolated immobile indices / O. I. Kostyukova, T. V. Tchemisova // Optimization. – 2018. – P. 1–20. https://doi.org/10.1080/02331934.2018.1539482
7. Bonnans, J. F. Perturbation Analysis of Optimization Problems// J. F. Bonnans, A. Shapiro. – New-York: SpringerVerlag, 2000. – 601 p. https://doi.org/10.1007/978-1-4612-1394-9
8. Kostyukova, O. I. Optimality Conditions for Convex Semi-Infinite Programming Problems with Finitely Representable Compact Index Sets / O. I. Kostyukova, T. V. Tchemisova // J. Optim. Theory Appl. – 2017. – Vol. 175, № 1. – P. 76–103. https://doi.org/10.1007/s10957-017-1150-z
9. Kostyukova, O. I. Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem / O. I. Kostyukova, T. V. Tchemisova // Set-Valued and Variational Analysis. – 2015. – Vol. 23, № 3. – P. 519–546. https://doi.org/10.1007/s11228-015-0320-0
10. Ahmed, F. Copositive Programming via Semi-Infinite Optimization / F. Ahmed, M. Dür, G. Still // J. Optim. Theory Appl. – 2013. – Vol. 159, № 2. – P. 322–340. https://doi.org/10.1007/s10957-013-0344-2
11. Kostyukova, O. I. Implicit Optimality Criterion for Convex SIP problem with Box Constrained Index Set / O. I. Kostyukova, T. V. Tchemisova // TOP. – 2012. – Vol. 20, № 2. – P. 475–502. https://doi.org/10.1007/s11750-011-0189-5
12. Eaves, B. C. On quadratic programming / B. C. Eaves // Management Science. – 1971. – Vol. 17, № 11. – P. 698–711. https://doi.org/10.1287/mnsc.17.11.698
13. Левин, В. Л. Применение теоремы Э. Хелли в выпуклом программировании, задачах наилучшего при ближения и смежных вопросах / В. Л. Левин // Мат. сб. – 1969. – Вып. 79 (21), № 2 (6). – С. 250–263.
