{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:28:33Z","timestamp":1740144513548,"version":"3.37.3"},"reference-count":51,"publisher":"EDP Sciences","license":[{"start":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T00:00:00Z","timestamp":1614643200000},"content-version":"vor","delay-in-days":60,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"funder":[{"DOI":"10.13039\/501100004252","name":"Qatar University","doi-asserted-by":"publisher","award":["NCBP-QUCP-CAS-2020-1"],"award-info":[{"award-number":["NCBP-QUCP-CAS-2020-1"]}],"id":[{"id":"10.13039\/501100004252","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2020,11,13]]},"published-print":{"date-parts":[[2021]]},"abstract":"<jats:p>In this paper, we study a nonconvex quadratic minimization problem with two quadratic constraints, one of which being convex. We introduce two convex quadratic relaxations (CQRs) and discuss cases, where the problem is equivalent to exactly one of the CQRs. Particularly, we show that the global optimal solution can be recovered from an optimal solution of the CQRs. Through this equivalence, we introduce new conditions under which the problem enjoys strong Lagrangian duality, generalizing the recent condition in the literature. Finally, under the new conditions, we present necessary and sufficient conditions for global optimality of the problem.<\/jats:p>","DOI":"10.1051\/ro\/2020130","type":"journal-article","created":{"date-parts":[[2020,11,14]],"date-time":"2020-11-14T21:56:53Z","timestamp":1605391013000},"page":"S2905-S2922","source":"Crossref","is-referenced-by-count":0,"special_numbering":"Supplement","title":["Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality"],"prefix":"10.1051","volume":"55","author":[{"given":"Abdelouahed","family":"Hamdi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akram","family":"Taati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Temadher A.","family":"Almaadeed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2021,3,2]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10107-017-1206-8","volume":"173","author":"Adachi","year":"2019","journal-title":"Math. Program"},{"key":"R2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1137\/16M1058200","volume":"27","author":"Adachi","year":"2017","journal-title":"SIAM J. Optim"},{"key":"R3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"Alizadeh","year":"2003","journal-title":"Math. Program"},{"key":"R4","doi-asserted-by":"crossref","first-page":"1735","DOI":"10.1137\/07070601X","volume":"19","author":"Ai","year":"2009","journal-title":"SIAM J. Optim"},{"key":"R5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.3934\/naco.2019046","volume":"10","author":"Ansary Karbasy","year":"2020","journal-title":"Numer. Algebra Control Optim"},{"key":"R6","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1137\/050644471","volume":"17","author":"Beck","year":"2006","journal-title":"SIAM J. Optim"},{"key":"R7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-013-0710-8","volume":"143","author":"Ben-Tal","year":"2014","journal-title":"Math. Program"},{"key":"R8","first-page":"51","volume":"72","author":"Ben-Tal","year":"1996","journal-title":"Math. Program"},{"key":"R9","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/15M1009871","volume":"26","author":"Bienstock","year":"2016","journal-title":"SIAM J. Optim"},{"key":"R10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0962492900002518","volume":"4","author":"Boggs","year":"1995","journal-title":"Acta Numer"},{"key":"R11","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-014-0836-3","volume":"151","author":"Bomze","year":"2015","journal-title":"Math. Program"},{"key":"R12","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/s10898-018-0607-4","volume":"71","author":"Bomze","year":"2018","journal-title":"J. Global Optim"},{"key":"R13","unstructured":"Celis M.R., Dennis J.E. and Tapia R.A., A trust region strategy for nonlinear equality constrained optimization, edited by Boggs P.T., Byrd R.H. and Schnabel R.B.. In: Numerical Optimization. SIAM, Philadelphia (1985) 71\u201382."},{"key":"R14","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1052623498335018","volume":"10","author":"Chen","year":"1999","journal-title":"SIAM J. Optim"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Conn A.R., Gould N.I.M. and Toint P.L., Trust Region Methods. SIAM, Philadelphia, PA (2000).","DOI":"10.1137\/1.9780898719857"},{"key":"R16","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10898-010-9625-6","volume":"54","author":"Feng","year":"2012","journal-title":"J. Global Optim"},{"key":"R17","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1088\/0266-5611\/14\/4\/009","volume":"14","author":"Fehmers","year":"1998","journal-title":"Inverse Prob"},{"key":"R18","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1080\/10556780410001647186","volume":"19","author":"Fortin","year":"2004","journal-title":"Optim. Methods Softw"},{"key":"R19","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/BF01385796","volume":"59","author":"Golub","year":"1991","journal-title":"Numer. Math"},{"key":"R20","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1137\/S1052623497322735","volume":"9","author":"Gould","year":"1999","journal-title":"SIAM J. Optim"},{"key":"R21","unstructured":"Grant M. and Boyd S., CVX: Matlab software for disciplined convex programming, version 2.1. http:\/\/cvxr.com\/cvx (2014) 21\u201357."},{"key":"R22","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1137\/16M1065197","volume":"27","author":"Ho-Nguyen","year":"2017","journal-title":"SIAM J. Optim"},{"key":"R23","unstructured":"Hsia Y. and Sheu R.L., Trust region subproblem with a fixed number of additional linear inequality constraints has polynomial complexity. Preprint arXiv:1312.1398 (2013)."},{"key":"R24","first-page":"461","volume":"10","author":"Hsia","year":"2014","journal-title":"Pac. J. Optim"},{"key":"R25","doi-asserted-by":"crossref","first-page":"3384","DOI":"10.1137\/100791841","volume":"20","author":"Jeyakumar","year":"2010","journal-title":"SIAM J. Optim"},{"key":"R26","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.orl.2011.02.007","volume":"39","author":"Jeyakumar","year":"2011","journal-title":"Oper. Res. Lett"},{"key":"R27","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10107-013-0716-2","volume":"147","author":"Jeyakumar","year":"2014","journal-title":"Math. Program"},{"key":"R28","doi-asserted-by":"crossref","first-page":"1649","DOI":"10.1137\/15M1023920","volume":"26","author":"Jiang","year":"2016","journal-title":"SIAM J. Optim"},{"key":"R29","doi-asserted-by":"crossref","first-page":"1603","DOI":"10.1137\/18M1174313","volume":"29","author":"Jiang","year":"2019","journal-title":"SIAM J. Optim"},{"key":"R30","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10107-017-1145-4","volume":"169","author":"Jiang","year":"2018","journal-title":"Math. Program"},{"key":"R31","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1137\/S003614450444556X","volume":"47","author":"Lancaster","year":"2005","journal-title":"SIAM Rev"},{"key":"R32","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.orl.2014.12.002","volume":"43","author":"Locatelli","year":"2015","journal-title":"Oper. Res. Lett"},{"key":"R33","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1007\/s11590-016-1001-0","volume":"10","author":"Locatelli","year":"2016","journal-title":"Optim. Lett"},{"key":"R34","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/10556789308805542","volume":"2","author":"Mor\u00e9","year":"1993","journal-title":"Optim. Methods Softw"},{"key":"R35","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"Mor\u00e9","year":"1983","journal-title":"SIAM J. Sci. Stat. Comput"},{"key":"R36","unstructured":"Omatu S. and Seinfeld J.H., Distributed Parameter Systems: Theory and Applications. Clarendon Press (1989)."},{"key":"R37","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10589-013-9635-7","volume":"58","author":"Pong","year":"2014","journal-title":"Comput. Optim. App"},{"key":"R38","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01588787","volume":"49","author":"Powell","year":"1991","journal-title":"Math. Program"},{"key":"R39","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1137\/S105262349928887X","volume":"11","author":"Rojas","year":"2001","journal-title":"SIAM J. Optim"},{"key":"R40","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1137\/15100624X","volume":"26","author":"Sakaue","year":"2016","journal-title":"SIAM J. Optim"},{"key":"R41","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s40314-016-0349-1","volume":"37","author":"Salahi","year":"2018","journal-title":"Comput. Appl. Math"},{"key":"R42","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s40314-016-0347-3","volume":"37","author":"Salahi","year":"2018","journal-title":"Comput. Appl. Math"},{"key":"R43","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10589-016-9867-4","volume":"66","author":"Salahi","year":"2017","journal-title":"Comput. Optim. App"},{"key":"R44","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1287\/moor.28.2.246.14485","volume":"28","author":"Sturm","year":"2003","journal-title":"Math. Oper. Res"},{"key":"R45","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10589-019-00105-w","volume":"74","author":"Taati","year":"2019","journal-title":"Comput. Optim. App"},{"key":"R46","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1080\/01630563.2020.1733605","volume":"41","author":"Taati","year":"2020","journal-title":"Numer. Funct. Anal. Optim"},{"key":"R47","unstructured":"Wang A.L. and Kilin\u00e7-Karzan F., On the tightness of SDP relaxations of QCQPs. Technical Report, arXiv:1911.09195 (2019)."},{"key":"R48","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1137\/S105262340139001X","volume":"14","author":"Ye","year":"2003","journal-title":"SIAM J. Optim"},{"key":"R49","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01580852","volume":"47","author":"Yuan","year":"1990","journal-title":"Math. Program"},{"key":"R50","first-page":"348","volume":"9","author":"Yuan","year":"1991","journal-title":"J. Comput. Math"},{"key":"R51","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01581194","volume":"55","author":"Zhang","year":"1992","journal-title":"Math. Program"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2020130\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T09:39:27Z","timestamp":1614677967000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2020130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":51,"alternative-id":["ro200379"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2020130","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"1290-3868"}],"subject":[],"published":{"date-parts":[[2021]]}}}