{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T05:21:24Z","timestamp":1739424084876,"version":"3.37.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004270","name":"Royal Institute of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004270","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":[[2025,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>This paper proposes a new approach for solving Quadratically Constrained Feasibility Problems (QCFPs). We introduce an isomorphic mapping (one-to-one and onto correspondence), which equivalently converts the QCFP to an optimization problem called the Inside-Ellipsoids Outside-Sphere Problem (IEOSP). This mapping preserves the convexity of convex constraints, but it converts all non-convex constraints to convex ones. The QCFP is a feasibility problem with non-convex constraints, while the IEOSP is an optimization problem with a convex feasible region and a non-convex objective function. It is shown that the global optimal solution of IEOSP is a feasible solution of the QCFP. Comparing the structures of QCFP and the proposed IEOSP, the second model only has one extra variable compared to the original QCFP because it employs one slack variable for the mapping. Thus, the problem dimension approximately remains unchanged. Due to the convexity of all constraints in IEOSP, it has a well-defined feasible region. Therefore, it can be solved much easier than the original QCFP. This paper proposes a solution algorithm for IEOSP that iteratively solves a convex optimization problem. The algorithm is mathematically shown to reach either a feasible solution of the QCFP or a local solution of the IEOSP. To illustrate our theoretical developments, a comprehensive numerical experiment is performed, and 500 different QCFPs are studied. All these numerical experiments confirm the promising performance and applicability of our theoretical developments in the current paper.\n<\/jats:p>","DOI":"10.1007\/s10957-024-02569-1","type":"journal-article","created":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T11:56:01Z","timestamp":1737546961000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Nonconvex Quadratically-Constrained Feasibility Problems: An Inside-Ellipsoids Outside-Sphere Model"],"prefix":"10.1007","volume":"204","author":[{"given":"Roozbeh","family":"Abolpour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9998-9773","authenticated-orcid":false,"given":"Mohammad Reza","family":"Hesamzadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maryam","family":"Dehghani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"issue":"2","key":"2569_CR1","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.1109\/TPWRS.2021.3104928","volume":"37","author":"R Abolpour","year":"2021","unstructured":"Abolpour, R., Hesamzadeh, M.R., Dehghani, M.: A new power flow model with a single nonconvex quadratic constraint: the LMI approach. IEEE Trans. Power Syst. 37(2), 1218\u20131229 (2021). https:\/\/doi.org\/10.1109\/TPWRS.2021.3104928","journal-title":"IEEE Trans. Power Syst."},{"key":"2569_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2022.110738","volume":"147","author":"R Abolpour","year":"2023","unstructured":"Abolpour, R., Dehghani, M., Hesamzadeh, M.R.: Inside-ellipsoid outside-sphere (IEOS) model for general bilinear feasibility problems: feasibility analysis and solution algorithm. Automatica 147, 110738 (2023). https:\/\/doi.org\/10.1016\/j.automatica.2022.110738","journal-title":"Automatica"},{"issue":"3","key":"2569_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01099462","volume":"6","author":"FA Al-Khayyal","year":"1995","unstructured":"Al-Khayyal, F.A., Larsen, C., Van Voorhis, T.: A relaxation method for nonconvex quadratically constrained quadratic programs. J. Glob. Optim. 6(3), 215\u2013230 (1995). https:\/\/doi.org\/10.1007\/BF01099462","journal-title":"J. Glob. Optim."},{"key":"2569_CR4","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"KM Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 43, 471\u2013484 (2009). https:\/\/doi.org\/10.1007\/s10898-008-9372-0","journal-title":"J. Glob. Optim."},{"issue":"2","key":"2569_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10107-012-0602-3","volume":"136","author":"KM Anstreicher","year":"2012","unstructured":"Anstreicher, K.M.: On convex relaxations for quadratically constrained quadratic programming. Math. Program. 136(2), 233\u2013251 (2012). https:\/\/doi.org\/10.1007\/s10107-012-0602-3","journal-title":"Math. Program."},{"key":"2569_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10107-011-0462-2","volume":"129","author":"X Bao","year":"2011","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Semidefinite relaxations for quadratically constrained quadratic programming: a review and comparisons. Math. Program. 129, 129\u2013157 (2011). https:\/\/doi.org\/10.1007\/s10107-011-0462-2","journal-title":"Math. Program."},{"key":"2569_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-013-0710-8","volume":"143","author":"A Ben-Tal","year":"2014","unstructured":"Ben-Tal, A., Den Hertog, D.: Hidden conic quadratic representation of some nonconvex quadratic optimization problems. Math. Program. 143, 1\u201329 (2014). https:\/\/doi.org\/10.1007\/s10107-013-0710-8","journal-title":"Math. Program."},{"key":"2569_CR8","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1002\/nav.20011","volume":"51","author":"HP Benson","year":"2004","unstructured":"Benson, H.P.: Concave envelopes of monomial functions over rectangles. Naval Res. Logist. (NRL) 51, 467\u2013476 (2004). https:\/\/doi.org\/10.1002\/nav.20011","journal-title":"Naval Res. Logist. (NRL)"},{"key":"2569_CR9","doi-asserted-by":"publisher","unstructured":"Burer, S., Saxena, A.: The MILP Road to MIQCP.: Mixed Integer Nonlinear Programming. pp. 373\u2013405, Springer, Berlin (2011). https:\/\/doi.org\/10.1007\/978-1-4614-1927-3_13","DOI":"10.1007\/978-1-4614-1927-3_13"},{"issue":"2","key":"2569_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10107-006-0080-6","volume":"113","author":"S Burer","year":"2008","unstructured":"Burer, S., Vandenbussche, D.: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Program. 113(2), 259\u2013282 (2008). https:\/\/doi.org\/10.1007\/s10107-006-0080-6","journal-title":"Math. Program."},{"issue":"1","key":"2569_CR11","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10107-014-0749-1","volume":"149","author":"S Burer","year":"2015","unstructured":"Burer, S., Yang, B.: The trust region subproblem with non-intersecting linear constraints. Math. Program. 149(1), 253\u2013264 (2015). https:\/\/doi.org\/10.1007\/s10107-014-0749-1","journal-title":"Math. Program."},{"key":"2569_CR12","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10107-016-1095-2","volume":"165","author":"C Chen","year":"2017","unstructured":"Chen, C., Atamt\u00fcrk, A., Oren, S.S.: A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables. Math. Program. 165, 549\u2013577 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1095-2","journal-title":"Math. Program."},{"issue":"1","key":"2569_CR13","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1515\/math-2017-0099","volume":"15","author":"Z Hou","year":"2017","unstructured":"Hou, Z., Jiao, H., Cai, L., Bai, C.: Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs. Open Math. 15(1), 1212\u20131224 (2017). https:\/\/doi.org\/10.1515\/math-2017-0099","journal-title":"Open Math."},{"issue":"17","key":"2569_CR14","doi-asserted-by":"publisher","first-page":"7655","DOI":"10.1002\/rnc.5215","volume":"30","author":"H Javanmardi","year":"2020","unstructured":"Javanmardi, H., Dehghani, M., Mohammadi, M., Vafamand, N.: Bilinear matrix inequality-based nonquadratic controller design for polytopic-linear parameter varying systems. Int. J. Robust Nonlinear Control 30(17), 7655\u20137669 (2020). https:\/\/doi.org\/10.1002\/rnc.5215","journal-title":"Int. J. Robust Nonlinear Control"},{"key":"2569_CR15","unstructured":"Jiang, R., Li, D.: Convex relaxations with second-order cone constraints for nonconvex quadratically constrained quadratic programming. (2016)"},{"key":"2569_CR16","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-030-21803-4_22","volume-title":"Optimization of Complex Systems: Theory, Models, Algorithms and Applications","author":"R Jiang","year":"2019","unstructured":"Jiang, R., Li, D.: Semidefinite programming based convex relaxation for nonconvex quadratically constrained quadratic programming. In: Le Thi, H.A., Le, H.M., Dinh, T.P. (eds.) Optimization of Complex Systems: Theory, Models, Algorithms and Applications, vol. 991, pp. 213\u2013220. Springer, Berlin (2019). https:\/\/doi.org\/10.1007\/978-3-030-21803-4_22"},{"key":"2569_CR17","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10107-005-0582-7","volume":"103","author":"J Linderoth","year":"2005","unstructured":"Linderoth, J.: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math. Program. 103, 251\u2013282 (2005). https:\/\/doi.org\/10.1007\/s10107-005-0582-7","journal-title":"Math. Program."},{"issue":"1","key":"2569_CR18","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I-convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976). https:\/\/doi.org\/10.1007\/BF01580665","journal-title":"Math. Program."},{"issue":"1","key":"2569_CR19","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/10556788.2014.916287","volume":"30","author":"R Misener","year":"2014","unstructured":"Misener, R., Smadbeck, J.B., Floudas, C.A.: Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2. Optim. Methods Softw. 30(1), 215\u2013249 (2014). https:\/\/doi.org\/10.1080\/10556788.2014.916287","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"2569_CR20","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"PM Pardalos","year":"1991","unstructured":"Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is NP-hard. J. Glob. Optim. 1(1), 15\u201322 (1991). https:\/\/doi.org\/10.1007\/BF00120662","journal-title":"J. Glob. Optim."},{"key":"2569_CR21","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1023\/A:1008377529330","volume":"13","author":"U Raber","year":"1998","unstructured":"Raber, U.: A simplicial branch-and-bound method for solving nonconvex all-quadratic programs. J. Glob. Optim. 13, 417\u2013432 (1998). https:\/\/doi.org\/10.1023\/A:1008377529330","journal-title":"J. Glob. Optim."},{"issue":"4","key":"2569_CR22","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1002\/rnc.3956","volume":"28","author":"M Saeki","year":"2018","unstructured":"Saeki, M.: $$L_1$$ synthesis of a static output controller for positive systems by LMI iteration. Int. J. Robust Nonlinear Control 28(4), 1319\u20131333 (2018). https:\/\/doi.org\/10.1002\/rnc.3956","journal-title":"Int. J. Robust Nonlinear Control"},{"key":"2569_CR23","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"2013","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31. Springer Science & Business Media, Berlin (2013)"},{"issue":"2","key":"2569_CR24","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1287\/moor.28.2.246.14485","volume":"28","author":"JF Sturm","year":"2003","unstructured":"Sturm, J.F., Zhang, S.: On cones of nonnegative quadratic functions. Math. Oper. Res. 28(2), 246\u2013267 (2003). https:\/\/doi.org\/10.1287\/moor.28.2.246.14485","journal-title":"Math. Oper. Res."},{"key":"2569_CR25","volume-title":"Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications","author":"M Tawarmalani","year":"2013","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, vol. 65. Springer Science & Business Media, Berlin (2013)"},{"issue":"2","key":"2569_CR26","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10107-011-0466-y","volume":"129","author":"XJ Zheng","year":"2011","unstructured":"Zheng, X.J., Sun, X.L., Li, D.: Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation. Math. Program. 129(2), 301\u2013329 (2011). https:\/\/doi.org\/10.1007\/s10107-011-0466-y","journal-title":"Math. Program."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02569-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02569-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-02569-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T12:55:05Z","timestamp":1739364905000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02569-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,22]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2569"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02569-1","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2025,1,22]]},"assertion":[{"value":"28 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"34"}}