{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:35:32Z","timestamp":1772120132287,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T00:00:00Z","timestamp":1701820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T00:00:00Z","timestamp":1701820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005357","name":"Agent\u00fara na Podporu V\u00fdskumu a V\u00fdvoja","doi-asserted-by":"publisher","award":["APVV-20-0311"],"award-info":[{"award-number":["APVV-20-0311"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005357","name":"Agent\u00fara na Podporu V\u00fdskumu a V\u00fdvoja","doi-asserted-by":"publisher","award":["APVV-20-0311"],"award-info":[{"award-number":["APVV-20-0311"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007594","name":"Comenius University in Bratislava","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100007594","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this paper, we study Lagrangian duality aspects in convex conic programming over general convex cones. It is known that the duality in convex optimization is linked with specific theorems of alternatives. We formulate and prove the strong alternative theorems to the strict feasibility and analyze the relation between the boundedness of the optimal solution sets and the existence of the relative interior points in the feasible set. We also provide sufficient conditions under which the duality gap is zero and the optimal solution sets are unbounded. As a consequence, we obtain several new sufficient conditions that guarantee the strong duality between primal and dual convex conic programs. Our proofs are based only on fundamental convex analysis and linear algebra results.<\/jats:p>","DOI":"10.1007\/s43069-023-00279-4","type":"journal-article","created":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T07:02:31Z","timestamp":1701846151000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lagrangian Duality in Convex Conic Programming with Simple Proofs"],"prefix":"10.1007","volume":"4","author":[{"given":"Maria","family":"Trnovska","sequence":"first","affiliation":[]},{"given":"Jakub","family":"Hrdina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,6]]},"reference":[{"key":"279_CR1","volume-title":"Linear equalities and related systems","author":"RJ Duffin","year":"1956","unstructured":"Duffin RJ (1956) Infinite programs. In: Kuhn HW, Tucker AW (eds) Linear equalities and related systems. Princeton University Press, Princeton, USA"},{"issue":"1","key":"279_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F Alizadeh","year":"1998","unstructured":"Alizadeh F (1998) Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J Optim 5(1):13\u201351","journal-title":"SIAM J Optim"},{"issue":"4","key":"279_CR3","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1017\/S1446788700017882","volume":"30","author":"JM Borwein","year":"1981","unstructured":"Borwein JM (1981) Characterization of optimality for the abstract convex program with finite dimensional range. J Aust Math Soc 30(4):390\u2013411. https:\/\/doi.org\/10.1017\/S1446788700017882","journal-title":"J Aust Math Soc"},{"issue":"2","key":"279_CR4","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/0022-247X(81)90138-4","volume":"83","author":"J Borwein","year":"1981","unstructured":"Borwein J, Wolkowicz H (1981) Regularizing the abstract convex program. J Math Anal Appl 83(2):495\u2013530. https:\/\/doi.org\/10.1016\/0022-247X(81)90138-4","journal-title":"J Math Anal Appl"},{"key":"279_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02614433","volume":"77","author":"M Ramana","year":"1997","unstructured":"Ramana M (1997) An exact duality theory for semidefinite programming and its complexity implications. Math Program 77:129\u2013162","journal-title":"Math Program"},{"issue":"12","key":"279_CR6","doi-asserted-by":"publisher","first-page":"1922","DOI":"10.1287\/mnsc.41.12.1922","volume":"41","author":"O G\u00fcller","year":"1995","unstructured":"G\u00fcller O, Ross C, Vial J-P, Terlaky T (1995) A survey of the implications of the central path for the duality theory for linear programming. Manage Sci 41(12):1922\u20131934","journal-title":"Manage Sci"},{"issue":"1","key":"279_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe L, Boyd S (1996) Semidefinite programming. SIAM Rev 38(1):49\u201395. https:\/\/doi.org\/10.1137\/1038003","journal-title":"SIAM Rev"},{"key":"279_CR8","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1017\/S0962492901000071","volume":"10","author":"MJ Todd","year":"2001","unstructured":"Todd MJ (2001) Semidefinite optimization. Acta Numer 10:515\u2013560","journal-title":"Acta Numer"},{"issue":"12","key":"279_CR9","first-page":"1","volume":"56","author":"M Trnovsk\u00e1","year":"2005","unstructured":"Trnovsk\u00e1 M (2005) Strong duality conditions in semidefinite programming. J Electr Eng 56(12):1\u20135","journal-title":"J Electr Eng"},{"key":"279_CR10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point polynomial algorithms in convex programming: theory and applications","author":"Y Nesterov","year":"1994","unstructured":"Nesterov Y, Nemirovski A (1994) Interior-point polynomial algorithms in convex programming: theory and applications. SIAM, Philadelphia, PA, USA"},{"key":"279_CR11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on modern convex optimization, analysis, algorithms and engineering applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal A, Nemirovski A (2001) Lectures on modern convex optimization, analysis, algorithms and engineering applications. MPS-SIAM series on optimization, Philadelphia, PA, USA"},{"key":"279_CR12","doi-asserted-by":"crossref","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, New York,NY, USA","DOI":"10.1017\/CBO9780511804441"},{"key":"279_CR13","unstructured":"P\u00f3lik I, Terlaky T (2007) Exact duality for optimization over symmetric cones. Technical Report, McMaster University, Hamilon, ON, Canada. https:\/\/optimization-online.org\/2007\/08\/1754\/"},{"issue":"2","key":"279_CR14","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s10589-012-9480-0","volume":"53","author":"L Tun\u00e7el","year":"2012","unstructured":"Tun\u00e7el L, Wolkowicz H (2012) Strong duality and minimal representations for cone optimization. Comput Optim Appl 53(2):619\u2013648","journal-title":"Comput Optim Appl"},{"key":"279_CR15","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10898-021-00995-3","volume":"83","author":"OI Kostyukova","year":"2022","unstructured":"Kostyukova OI, Tchemisova TV (2022) On strong duality in linear copositive programming. J Global Optim 83:457\u2013480. https:\/\/doi.org\/10.1007\/s10898-021-00995-3","journal-title":"J Global Optim"},{"key":"279_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s11590-015-0868-5","volume":"10","author":"D Henrion","year":"2016","unstructured":"Henrion D, Josz C (2016) Strong duality in Lasserre\u2019s hierarchy for polynomial optimization. Optim Lett 10:3\u201310","journal-title":"Optim Lett"},{"key":"279_CR17","volume-title":"Convex analysis and optimization","author":"DP Bertsekas","year":"2003","unstructured":"Bertsekas DP, Nedi\u0107 A, Ozdaglar AE (2003) Convex analysis and optimization. Athena Scientific, Belmont, Mass, USA"},{"key":"279_CR18","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton, USA"},{"key":"279_CR19","volume-title":"Fundamentals of convex analysis","author":"J-B Hiriart-Urrut","year":"2004","unstructured":"Hiriart-Urrut J-B, Lemar\u00e9chal C (2004) Fundamentals of convex analysis. Springer, Berlin Heidelberg"},{"key":"279_CR20","unstructured":"Luo Z-Q, Sturm JF, Zhang S (1997) Duality results for conic convex programming. Econometric Institute Report No. 9719\/A"},{"key":"279_CR21","volume-title":"Geometry of convex sets","author":"IE Leonard","year":"2015","unstructured":"Leonard IE, Lewis JE (2015) Geometry of convex sets. Wiley, New Jersey, USA"},{"key":"279_CR22","first-page":"1","volume":"124","author":"G Farkas","year":"1902","unstructured":"Farkas G (1902) \u00dcber die theorie der einfachen ungleichungen. J F\u00fcr die Reine und Angewandte Mathematik 124:1\u201327","journal-title":"J F\u00fcr die Reine und Angewandte Mathematik"},{"issue":"2","key":"279_CR23","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/moor.1060.0242","volume":"32","author":"G Pataki","year":"2007","unstructured":"Pataki G (2007) On the closedness of the linear image of a closed convex cone. Math Oper Res 32(2):395\u2013412","journal-title":"Math Oper Res"},{"issue":"3\u20134","key":"279_CR24","first-page":"699","volume":"16","author":"J Borwein","year":"2009","unstructured":"Borwein J, Moors W (2009) Stability of closedness of convex cones under linear mappings. J Convex Anal 16(3\u20134):699\u2013705","journal-title":"J Convex Anal"},{"key":"279_CR25","unstructured":"Vandenberghe L, Balakhrishnan V (2002) Semidefinite programming duality and linear time invariant systems. Technical Report, School of Electrical and Computer Engineering, Purdue University"},{"key":"279_CR26","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01584093","volume":"1","author":"A Berman","year":"1971","unstructured":"Berman A, Ben-Israel A (1971) Linear inequalities, mathematical programming and matrix theory. Math Program 1:291\u2013300","journal-title":"Math Program"},{"issue":"2","key":"279_CR27","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0022-247X(69)90054-7","volume":"27","author":"A Ben-Israel","year":"1969","unstructured":"Ben-Israel A (1969) Linear equations and inequalities on finite dimensional real or complex, vector spaces: a unified theory. J Math Anal Appl 27(2):367\u2013389","journal-title":"J Math Anal Appl"},{"issue":"6","key":"279_CR28","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1137\/0508076","volume":"8","author":"BD Craven","year":"1977","unstructured":"Craven BD, Koliha JJ (1977) Generalizations of Farkas\u2019 theorem. SIAM J Math Anal 8(6):983\u2013997","journal-title":"SIAM J Math Anal"},{"issue":"2","key":"279_CR29","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0024-3795(73)90048-7","volume":"7","author":"A Berman","year":"1973","unstructured":"Berman A, Ben-Israel A (1973) Linear equations over cones with interior: a solvability theorem with applications to matrix theory. Linear Algebra Appl 7(2):139\u2013149","journal-title":"Linear Algebra Appl"},{"key":"279_CR30","volume-title":"The theory of linear economic models","author":"D Gale","year":"1960","unstructured":"Gale D (1960) The theory of linear economic models. McGraw-Hill Book Company, New York, USA"},{"key":"279_CR31","doi-asserted-by":"crossref","unstructured":"Nemirovski A (2007) Advances in convex optimization: conic programming. In: Sanz-Sol M, Soria J, Varona JL, Verdeta J (eds) Proceedings of International Congress of Mathematicians, Madrid, August 22-30, 2006, pp 413\u2013444. EMS -European Mathematical Society Publishing House, New York, NY","DOI":"10.4171\/022-1\/17"},{"key":"279_CR32","doi-asserted-by":"crossref","unstructured":"Shapiro A (2000) On duality theory of conic linear problems. Kluwer Academic Publishers,Dordrecht, NL","DOI":"10.1007\/978-1-4757-3403-4_7"},{"key":"279_CR33","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer S (2009) On the copositive representation of binary and continuous nonconvex quadratic programs. Math Program 120:479\u2013495. https:\/\/doi.org\/10.1007\/s10107-008-0223-z","journal-title":"Math Program"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00279-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-023-00279-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00279-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T12:03:14Z","timestamp":1706875394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-023-00279-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,6]]},"references-count":33,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["279"],"URL":"https:\/\/doi.org\/10.1007\/s43069-023-00279-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1990595\/v1","asserted-by":"object"}]},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,6]]},"assertion":[{"value":"23 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interest"}}],"article-number":"97"}}