{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T01:42:32Z","timestamp":1775094152036,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T00:00:00Z","timestamp":1724889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T00:00:00Z","timestamp":1724889600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100007689","name":"Universidade de Aveiro","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100007689","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we establish new necessary and sufficient conditions guaranteeing the uniform LP duality for linear problems of Copositive Programming and formulate these conditions in different equivalent forms. The main results are obtained using the approach developed in previous papers of the authors and based on a concept of immobile indices that permits alternative representations of the set of feasible solutions.<\/jats:p>","DOI":"10.1007\/s10957-024-02515-1","type":"journal-article","created":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T15:09:53Z","timestamp":1724944193000},"page":"1940-1966","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Uniform Duality in Copositive Optimization"],"prefix":"10.1007","volume":"203","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":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6788-8783","authenticated-orcid":false,"given":"O. S.","family":"Dudina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,29]]},"reference":[{"issue":"3","key":"2515_CR1","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\u2014recent developments and applications. Eur J Oper Res 216(3), 509\u2013520 (2012)","journal-title":"Eur J Oper Res"},{"key":"2515_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BFb0120983","volume":"19","author":"JM Borwein","year":"1982","unstructured":"Borwein, J.M., Wolkowicz, H.: Characterizations of optimality without constraint qualification for the abstract convex program. Math. Program. Study 19, 77\u2013100 (1982)","journal-title":"Math. Program. Study"},{"key":"2515_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01581072","volume":"57","author":"JM Borwein","year":"1992","unstructured":"Borwein, J.M., Lewis, A.S.: Partially finite convex programming. Part I: Quasi-relative interiors and duality. Math. Program. 57, 15\u201348 (1992)","journal-title":"Math. Program."},{"issue":"9","key":"2515_CR4","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"issue":"1","key":"2515_CR5","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.jmaa.2011.03.005","volume":"380","author":"PJC Dickinson","year":"2011","unstructured":"Dickinson, P.J.C.: Geometry of the copositive and completely positive cones. J. Math. Anal. Appl. 380(1), 377\u2013395 (2011)","journal-title":"J. Math. Anal. Appl."},{"key":"2515_CR6","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1016\/j.jmaa.2016.01.063","volume":"437","author":"PJC Dickinson","year":"2016","unstructured":"Dickinson, P.J.C., Hildebrand, R.: Considering copositivity locally. J. Math. Anal. Appl. 437, 1184\u20131195 (2016)","journal-title":"J. Math. Anal. Appl."},{"key":"2515_CR7","series-title":"Lecture Notes in Econom and Math Systems","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-46477-5_4","volume-title":"Semi-infinite Programming and Applications","author":"RJ Duffin","year":"1983","unstructured":"Duffin, R.J., Jeroslow, R.G., Karlovitz, L.A.: Duality in semi-infinite linear programming. In: Fiacco, A.V., Kortanek, K.O. (eds.) Semi-infinite Programming and Applications. Lecture Notes in Econom and Math Systems, vol. 215, pp. 50\u201362. Springer, Berlin (1983)"},{"key":"2515_CR8","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\u2014-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-Verlag, Berlin, Heidelberg (2010)"},{"key":"2515_CR9","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1137\/080739124","volume":"20","author":"DH Fang","year":"2009","unstructured":"Fang, D.H., Li, C., Ng, K.F.: Constraint qualifications for extended Farkas\u2019s lemmas and Lagrangian dualities in convex infinite programming. SIAM J. Optim. 20, 1311\u20131332 (2009)","journal-title":"SIAM J. Optim."},{"key":"2515_CR10","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/790\/1\/012076","volume":"790","author":"X Hua","year":"2020","unstructured":"Hua, X., Zhong, M., Liu, Q., Wang, M.: List all maximal cliques of an undirected Graph: a parallable algorithm. IOP Conf. Ser. Mater. Sci. Eng. 790, 012076 (2020). https:\/\/doi.org\/10.1088\/1757-899X\/790\/1\/012076","journal-title":"IOP Conf. Ser. Mater. Sci. Eng."},{"key":"2515_CR11","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/BF02591942","volume":"27","author":"RG Jeroslow","year":"1983","unstructured":"Jeroslow, R.G.: Uniform duality in semi-infinite convex optimization. Math. Program. 27, 144\u2013154 (1983)","journal-title":"Math. Program."},{"key":"2515_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10957-007-9294-x","volume":"136","author":"V Jeyakumar","year":"2008","unstructured":"Jeyakumar, V.: Constraint qualifications characterizing Lagrangian duality in convex optimization. J. Optim. Theory Appl. 136, 31\u201341 (2008)","journal-title":"J. Optim. Theory Appl."},{"key":"2515_CR13","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2024.2346313","author":"OI Kostyukova","year":"2024","unstructured":"Kostyukova, O.I.: Non-exposed polyhedral faces of the completely positive cone. Linear Multilinear A (2024). https:\/\/doi.org\/10.1080\/03081087.2024.2346313","journal-title":"Linear Multilinear A"},{"key":"2515_CR14","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":"2515_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10957-009-9621-5","volume":"145","author":"OI Kostyukova","year":"2010","unstructured":"Kostyukova, O.I., Tchemisova, T.V., Yermalinskaya, S.A.: Convex semi-infinite programming: implicit optimality criterion based on the concept of immobile points. J. Optim. Theory Appl. 145(2), 325\u2013342 (2010)","journal-title":"J. Optim. Theory Appl."},{"issue":"11","key":"2515_CR16","doi-asserted-by":"publisher","first-page":"3211","DOI":"10.1080\/02331934.2022.2027939","volume":"71","author":"OI Kostyukova","year":"2022","unstructured":"Kostyukova, O.I., Tchemisova, T.V.: On equivalent representations and properties of faces of the cone of copositive matrices. Optimization 71(11), 3211\u20133239 (2022)","journal-title":"Optimization"},{"key":"2515_CR17","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10898-021-00995-3","volume":"83","author":"OI Kostyukova","year":"2022","unstructured":"Kostyukova, O.I., Tchemisova, T.V.: On strong duality in linear copositive programming. J. Glob. Optim. 83, 457\u2013480 (2022)","journal-title":"J. Glob. Optim."},{"key":"2515_CR18","unstructured":"Kostyukova, O.I., Tchemisova, T.V., Dudina, O.S.: Explicit criterion of uniform LP duality for linear problems of copositive optimization. (2023). arXiv:2302.09348 [math.OC]. Acessed 30 May 2024"},{"issue":"2","key":"2515_CR19","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":"2515_CR20","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1080\/02331930310001611484","volume":"52","author":"SJ Li","year":"2003","unstructured":"Li, S.J., Yang, X.Q., Teo, K.L.: Duality for semi-definite and semi-infinite programming. Optimization 52, 507\u2013528 (2003)","journal-title":"Optimization"},{"issue":"2","key":"2515_CR21","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/10556789208805510","volume":"1","author":"Y Nesterov","year":"1992","unstructured":"Nesterov, Y., Nemirovski, A.: Conic formulation of a convex programming problem and duality. Optim. Methods Softw. 1(2), 95\u2013115 (1992)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"2515_CR22","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/15M1041924","volume":"27","author":"G Pataki","year":"2017","unstructured":"Pataki, G.: Bad semidefinite programs: they all look the same. SIAM J. Optim. 27(1), 146\u2013172 (2017)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2515_CR23","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1137\/17M1140844","volume":"61","author":"G Pataki","year":"2019","unstructured":"Pataki, G.: Characterizing bad semidefinite programs: normal forms and short proofs. SIAM Rev. 61(4), 839\u2013859 (2019)","journal-title":"SIAM Rev."},{"key":"2515_CR24","unstructured":"Pataki, G.: On positive duality gaps in semidefinite programming. (2020). arXiv:1812.11796 [math.OC]. Accessed 30 May 2024"},{"key":"2515_CR25","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/moor.1060.0242","volume":"32","author":"G Pataki","year":"2007","unstructured":"Pataki, G.: On the closedness of the linear image of a closed convex cone. Math. Oper. Res. 32, 395\u2013412 (2007)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2515_CR26","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.jmaa.2012.10.033","volume":"400","author":"G Pataki","year":"2013","unstructured":"Pataki, G.: On the connection of facially exposed and nice cones. J. Math. Anal. Appl. 400(1), 211\u2013221 (2013)","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"2515_CR27","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1137\/S1052623495288350","volume":"7","author":"MV Ramana","year":"1997","unstructured":"Ramana, M.V., Tun\u00e7el, L., Wolkowicz, H.: Strong duality for semidefinite programming. SIAM J. Optim. 7(3), 641\u2013662 (1997)","journal-title":"SIAM J. Optim."},{"key":"2515_CR28","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10100-007-0048-5","volume":"16","author":"Q Zhang","year":"2008","unstructured":"Zhang, Q.: Uniform LP duality for semidefinite and semi-infinite programming. CEJOR 16, 205\u2013213 (2008)","journal-title":"CEJOR"},{"key":"2515_CR29","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.laa.2018.08.028","volume":"558","author":"Q Zhang","year":"2018","unstructured":"Zhang, Q.: Completely positive cones: Are they facially exposed? Linear Algebra Appl. 558, 195\u2013204 (2018)","journal-title":"Linear Algebra Appl."},{"key":"2515_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-024-02405-6","author":"Q Zhang","year":"2024","unstructured":"Zhang, Q.: Understanding badly and well-behaved linear matrix inequalities via semi-infinite optimization. J. Optim. Theory Appl. (2024). https:\/\/doi.org\/10.1007\/s10957-024-02405-6","journal-title":"J. Optim. Theory Appl."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02515-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02515-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02515-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T10:09:12Z","timestamp":1731319752000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02515-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,29]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["2515"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02515-1","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,29]]},"assertion":[{"value":"22 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}