{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:55Z","timestamp":1740145195745,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T00:00:00Z","timestamp":1647561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T00:00:00Z","timestamp":1647561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s11590-022-01870-0","type":"journal-article","created":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T15:09:28Z","timestamp":1647616168000},"page":"107-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An exact explicit dual for the linear copositive programming problem"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0959-0831","authenticated-orcid":false,"given":"O. I.","family":"Kostyukova","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2678-2552","authenticated-orcid":false,"given":"T. V.","family":"Tchemisova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,18]]},"reference":[{"key":"1870_CR1","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/s10957-013-0344-2","volume":"159","author":"F Ahmed","year":"2013","unstructured":"Ahmed, F., D\u00fcr, M., Still, G.: Copositive programming via semi-infinite optimization. J. Optim. Theory Appl. 159, 322\u2013340 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1870_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.ejor.2011.04.026","volume":"216","author":"IM Bomze","year":"2012","unstructured":"Bomze, I.M.: Copositive optimization - recent developments and applications. EJOR. 216(3), 509\u2013520 (2012)","journal-title":"EJOR."},{"key":"1870_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation analysis of optimization problems","author":"JF Bonnans","year":"2000","unstructured":"Bonnans, J.F., Shapiro, A.: Perturbation analysis of optimization problems. Springer-Verlag, New-York (2000)"},{"key":"1870_CR4","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/0022-247X(81)90138-4","volume":"83","author":"JM Borwein","year":"1981","unstructured":"Borwein, J.M., Wolkowicz, H.: Regularizing the abstract convex program. J. Math. Anal. Appl. 83, 495\u2013530 (1981)","journal-title":"J. Math. Anal. Appl."},{"key":"1870_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-12598-0_1","volume-title":"Recent advances in optimization and its applications in engineering","author":"M D\u00fcr","year":"2010","unstructured":"D\u00fcr, M.: Copositive programming: a survey. In: Diehl, M., Glineur, F., Jarlebring, E., Michielis, W. (eds.) Recent advances in optimization and its applications in engineering, pp. 3\u201320. Springer, Berlin (2010)"},{"key":"1870_CR6","unstructured":"Gowda, M. S., Sznajder, R.: On the non-homogeneity of completely positive cones, Technical Report trGOW11-04, Dep. Mathematics and Statistics University of Maryland, USA. http:\/\/www.optimization-online.org\/DB (2011) Accessed 7 Dec 2020"},{"key":"1870_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s11590-006-0038-x","volume":"2","author":"V Jeyakumar","year":"2008","unstructured":"Jeyakumar, V.: A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions. Optim. Lett. 2, 15\u201325 (2008)","journal-title":"Optim. Lett."},{"key":"1870_CR8","unstructured":"Kostyukova, O.I., Tchemisova, T.V.: On equivalent representations and properties of faces of the cone of copositive matrices. arXiv:2012.03610v1 [math.OC] (2020) Accessed Dec 7 (2020)"},{"issue":"1","key":"1870_CR9","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/s10957-017-1150-z","volume":"175","author":"OI Kostyukova","year":"2017","unstructured":"Kostyukova, O.I., Tchemisova, T.V.: Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets. J. Optim. Theory Appl. 175(1), 76\u2013103 (2017)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1870_CR10","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/s10958-012-0734-2","volume":"182","author":"OI Kostyukova","year":"2012","unstructured":"Kostyukova, O.I., Tchemisova, T.V.: Optimality criteria without constraint qualification for linear semidefinite problems. J. Math. Sci. 182(2), 126\u2013143 (2012)","journal-title":"J. Math. Sci."},{"key":"1870_CR11","doi-asserted-by":"publisher","unstructured":"Kostyukova, O.I., Tchemisova, T.V.: On strong duality in linear copositive programming. J. Glob. Optim. (2021). https:\/\/doi.org\/10.1007\/s10898-021-00995-3","DOI":"10.1007\/s10898-021-00995-3"},{"key":"1870_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s11228-019-00527-y","volume":"28","author":"OI Kostyukova","year":"2020","unstructured":"Kostyukova, O.I., Tchemisova, T.V., Dudina, O.S.: Immobile indices and CQ-free optimality criteria for linear copositive programming problems. Set-Valued Var. Anal. 28, 89\u2013107 (2020)","journal-title":"Set-Valued Var. Anal."},{"issue":"2","key":"1870_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1070\/SM1969v008n02ABEH001118","volume":"8","author":"VL Levin","year":"1969","unstructured":"Levin, V.L.: Application of E. Helly\u2019s theorem to convex programming, problems of best approximation and related questions. Math. USSR Sbornik 8(2), 235\u2013247 (1969)","journal-title":"Math. USSR Sbornik"},{"key":"1870_CR14","unstructured":"P\u00f3lik, I., Terlaky, T.: Exact duality for optimization over symmetric cones. AdvOL-Report No. 2007\/10 McMaster University, Advanced Optimization Lab., Hamilton, Canada. http:\/\/www.optimization-online.org\/DB_FILE\/2007\/08\/1754.pdf (2007). Accessed 7 Dec 2020"},{"key":"1870_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02614433","volume":"77","author":"MV Ramana","year":"1997","unstructured":"Ramana, M.V.: An exact duality theory for semidefinite programming and its complexity implications. Math. Prog. 77, 129\u2013162 (1997)","journal-title":"Math. Prog."},{"issue":"3","key":"1870_CR16","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1137\/S1052623495288350","volume":"7","author":"MV Ramana","year":"1997","unstructured":"Ramana, M.V., Tuncel, L., Wolkowicz, H.: Strong duality for semidefinite programming. SIAM J. Optim. 7(3), 641\u2013662 (1997)","journal-title":"SIAM J. Optim."},{"key":"1870_CR17","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s10589-012-9480-0","volume":"53","author":"L Tun\u00e7el","year":"2013","unstructured":"Tun\u00e7el, L., Wolkowicz, H.: Strong duality and minimal representations for cone optimization. Comput. Optim. Appl. 53, 619\u2013648 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"1870_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4381-7","volume-title":"Handbook of semidefinite programming. Theory, algorithms, and applications","author":"H Wolkowicz","year":"2000","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L.: Handbook of semidefinite programming. Theory, algorithms, and applications. Springer, New York (2000)"},{"key":"1870_CR19","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s11590-011-0282-6","volume":"6","author":"C Z\u01celinescu","year":"2012","unstructured":"Z\u01celinescu, C.: On duality gap in linear conic problems. Optim. Lett. 6, 393\u2013402 (2012)","journal-title":"Optim. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01870-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01870-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01870-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T10:56:53Z","timestamp":1672829813000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01870-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,18]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1870"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01870-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,3,18]]},"assertion":[{"value":"18 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}