{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:28:49Z","timestamp":1740144529893,"version":"3.37.3"},"reference-count":26,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T00:00:00Z","timestamp":1654128000000},"content-version":"vor","delay-in-days":32,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2022,5,4]]},"published-print":{"date-parts":[[2022,5]]},"abstract":"<jats:p>The paper is devoted to the regularization of linear Copositive Programming problems which consists of transforming a problem to an equivalent form, where the Slater condition is satisfied and therefore the strong duality holds. We describe regularization algorithms based on a concept of immobile indices and on the understanding of the important role that these indices play in the feasible sets' characterization. These algorithms are compared to some regularization procedures developed for a more general case of convex problems and based on a facial reduction approach. We show that the immobile-index-based approach combined with the specifics of copositive problems allows us to construct more explicit and detailed regularization algorithms for linear Copositive Programming problems than those already available.<\/jats:p>","DOI":"10.1051\/ro\/2022063","type":"journal-article","created":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T18:52:51Z","timestamp":1651776771000},"page":"1353-1371","source":"Crossref","is-referenced-by-count":0,"title":["Regularization algorithms for linear copositive problems"],"prefix":"10.1051","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0959-0831","authenticated-orcid":false,"given":"Olga I.","family":"Kostyukova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2678-2552","authenticated-orcid":false,"given":"Tatiana V.","family":"Tchemisova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2022,6,2]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/s10957-013-0344-2","volume":"159","author":"Ahmed","year":"2013","journal-title":"J. Optim. Theory Appl."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Anjos M.F., Lasserre J.B. (editors), Handbook of Semidefinite, Conic and Polynomial Optimization. International Series in Operational Research and Management Science. Vol. 166. Springer US (2012) 138.","DOI":"10.1007\/978-1-4614-0769-0"},{"key":"R3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ejor.2011.04.026","volume":"216","author":"Bomze","year":"2012","journal-title":"EJOR"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Bonnans J.F. and Shapiro A., Perturbation analysis of optimization problems. Springer-Verlag, New-York, NY (2000) 601.","DOI":"10.1007\/978-1-4612-1394-9"},{"key":"R5","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1017\/S1446788700017250","volume":"30","author":"Borwein","year":"1981","journal-title":"J. Austral. Math. Soc. Ser. A."},{"key":"R6","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/0022-247X(81)90138-4","volume":"83","author":"Borwein","year":"1981","journal-title":"J. Math. Anal. Appl."},{"key":"R7","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"de Klerk","year":"2002","journal-title":"SIAM J. Optim."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Drusvyatskiy D. and Wolkowicz H., The many faces of degeneracy in conic optimization. In: Foundations and Trends in Optimization. Vol. 3. Now Publishers Inc. (2017) 77\u2013170.","DOI":"10.1561\/2400000011"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"D\u00fcr M., Copositive programming \u2013 a survey. In: Recent Advances in Optimization and its Applications in Engineering, edited by Diehl M., Glineur F., Jarlebring E. and Michielis W.. Springer-Verlag, Berlin, Heidelberg (2010) 535.","DOI":"10.1007\/978-3-642-12598-0_1"},{"key":"R10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s101070100232","volume":"91","author":"Kortanek","year":"2001","journal-title":"Math. Program. Ser. A"},{"key":"R11","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/s10957-017-1150-z","volume":"175","author":"Kostyukova","year":"2017","journal-title":"J. Optim. Theory Appl."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Kostyukova O.I. and Tchemisova T.V., On equivalent representations and properties of faces of the cone of copositive matrices. Optimization (2020). DOI: 10.1080\/02331934.2022.2027939.","DOI":"10.3390\/math9212698"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Kostyukova O. and Tchemisova T., On strong duality in linear copositive programming. J. Global Optim. (2021) 1\u201324. DOI: 10.1007\/s10898-021-00995-3.","DOI":"10.1007\/s10898-021-00995-3"},{"key":"R14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s11228-019-00527-y","volume":"28","author":"Kostyukova","year":"2020","journal-title":"Set-Valued Var. Anal."},{"key":"R15","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1051\/ro\/2018034","volume":"52","author":"Letchford","year":"2018","journal-title":"RAIRO Oper. Res."},{"key":"R16","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1070\/SM1969v008n02ABEH001118","volume":"8","author":"Levin","year":"1969","journal-title":"Math. USSR Sbornik"},{"key":"R17","unstructured":"Luo Z.-Q., Sturm F.J. and Zhang S., Duality Results for Conic Convex Programming, Econometric institute report no. 9719\/a. Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute (1997)."},{"key":"R18","unstructured":"Pataki G., simple derivation of a facial reduction algorithm and extended dual systems. Preprint available at http:\/\/www.unc.edu\/pataki\/papers\/fr.pdf (2000)."},{"key":"R19","unstructured":"Permenter F., Friberg H. and Andersen E., Solving conic optimization problems via self-dual embedding and facial reduction: a unified approach. Tech. Report. (2015). DOI: 10.13140\/RG.2.1.4340.7847."},{"key":"R20","unstructured":"P\u00f3lik I. and Terlaky T., Exact Duality for Optimization Over Symmetric Cones. AdvOL-Report No. 2007\/10. McMaster University, Advanced Optimization Lab., Hamilton, Canada (2007)."},{"key":"R21","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1137\/S1052623495288350","volume":"7","author":"Ramana","year":"1997","journal-title":"SIAM J. Optim."},{"key":"R22","doi-asserted-by":"crossref","unstructured":"Solodov M.V., Constraint qualifications. In: Wiley Encyclopedia of Operations Research and Management Science, edited by Cochran J.J., et al. John Wiley & Sons, Inc. (2010).","DOI":"10.1002\/9780470400531.eorms0978"},{"key":"R23","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s10589-012-9480-0","volume":"53","author":"Tun\u00e7el","year":"2013","journal-title":"Comput. Optim. Appl."},{"key":"R24","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/s10957-012-0219-y","volume":"158","author":"Waki","year":"2013","journal-title":"J. Optim. Theory Appl."},{"key":"R25","unstructured":"Weber G.-W., Generalized semi-infinite optimization and related topics. In: Research and Exposition in Mathematics, edited by Hofmann K.H., Willem R.. Vol. 29. Heldermann Publishing House, Lemgo (2003)."},{"key":"R26","doi-asserted-by":"crossref","unstructured":"Wolkowicz H., Saigal R. and Vandenberghe L., Handbook of Semidefinite Programming \u2013 Theory, Algorithms, and Applications. Kluwer Academic Publishers (2000).","DOI":"10.1007\/978-1-4615-4381-7"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022063\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T07:54:33Z","timestamp":1654156473000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5]]},"references-count":26,"journal-issue":{"issue":"3"},"alternative-id":["ro200572"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2022063","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"2804-7303"}],"subject":[],"published":{"date-parts":[[2022,5]]}}}