{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T05:25:04Z","timestamp":1775021104802,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,12,10]],"date-time":"2016-12-10T00:00:00Z","timestamp":1481328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,12,10]],"date-time":"2016-12-10T00:00:00Z","timestamp":1481328000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-10-1-0168"],"award-info":[{"award-number":["FA9550-10-1-0168"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"name":"FERC"},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["PGS-D"],"award-info":[{"award-number":["PGS-D"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10107-016-1095-2","type":"journal-article","created":{"date-parts":[[2016,12,10]],"date-time":"2016-12-10T12:40:41Z","timestamp":1481373641000},"page":"549-577","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":45,"title":["A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables"],"prefix":"10.1007","volume":"165","author":[{"given":"Chen","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alper","family":"Atamt\u00fcrk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shmuel S.","family":"Oren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,10]]},"reference":[{"key":"1095_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33, 42\u201354 (2005)","journal-title":"Oper. Res. Lett."},{"key":"1095_CR2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-1-4757-3216-0_8","volume":"33","author":"ED Andersen","year":"2000","unstructured":"Andersen, E.D., Andersen, K.D.: The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm. High Perform. Optim. 33, 197\u2013232 (2000)","journal-title":"High Perform. Optim."},{"key":"1095_CR3","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. Global Optim. 43, 471\u2013484 (2009)","journal-title":"J. Global Optim."},{"key":"1095_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-010-0355-9","volume":"124","author":"KM Anstreicher","year":"2010","unstructured":"Anstreicher, K.M., Burer, S.: Computable representations for convex hulls of low-dimensional quadratic forms. Math. Program. 124, 33\u201343 (2010)","journal-title":"Math. Program."},{"key":"1095_CR5","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1016\/j.ijepes.2011.06.003","volume":"33","author":"X Bai","year":"2011","unstructured":"Bai, X., Wei, H.: A semidefinite programming method with graph partitioning technique for optimal power flow problems. Int. J. Electr. Power Energy Syst. 33, 1309\u20131314 (2011)","journal-title":"Int. J. Electr. Power Energy Syst."},{"key":"1095_CR6","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.ijepes.2007.12.003","volume":"30","author":"X Bai","year":"2008","unstructured":"Bai, X., Wei, H., Fujisawa, K., Wang, Y.: Semidefinite programming for optimal power flow problems. Int. J. Electr. Power Energy Syst. 30, 383\u2013392 (2008)","journal-title":"Int. J. Electr. Power Energy Syst."},{"key":"1095_CR7","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/10556780902883184","volume":"24","author":"X Bao","year":"2009","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs. Optim. Methods Softw. 24, 485\u2013504 (2009)","journal-title":"Optim. Methods Softw."},{"key":"1095_CR8","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1137\/050644471","volume":"17","author":"A Beck","year":"2006","unstructured":"Beck, A., Eldar, Y.C.: Strong duality in nonconvex quadratic optimization with two quadratic constraints. SIAM J. Optim. 17, 844\u2013860 (2006)","journal-title":"SIAM J. Optim."},{"key":"1095_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492913000032","volume":"22","author":"P Belotti","year":"2013","unstructured":"Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., Mahajan, A.: Mixed-integer nonlinear optimization. Acta Numer. 22, 1\u2013131 (2013)","journal-title":"Acta Numer."},{"key":"1095_CR10","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24, 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"1095_CR11","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1287\/moor.28.3.497.16392","volume":"28","author":"A Ben-Tal","year":"2003","unstructured":"Ben-Tal, A., Nemirovski, A., Roos, C.: Extended matrix cube theorems with applications to $$\\mu $$-theory in control. Math. Oper. Res. 28, 497\u2013523 (2003)","journal-title":"Math. Oper. Res."},{"key":"1095_CR12","volume-title":"Electrical Transmission System Cascades and Vulnerability: An Operations Research Viewpoint","author":"D Bienstock","year":"2016","unstructured":"Bienstock, D.: Electrical Transmission System Cascades and Vulnerability: An Operations Research Viewpoint, vol. 22. SIAM, Philadelphia (2016)"},{"key":"1095_CR13","unstructured":"Bienstock, D., Munoz, G.: LP Approximations to Mixed-Integer Polynomial Optimization Problems. arXiv:1501.00288 (2015)"},{"key":"1095_CR14","doi-asserted-by":"crossref","unstructured":"Blair, J.R.S., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation, pp. 1\u201329. Springer, New York (1993)","DOI":"10.1007\/978-1-4613-8369-7_1"},{"key":"1095_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-010-0010-8","volume":"2","author":"S Burer","year":"2010","unstructured":"Burer, S.: Optimizing a polyhedral-semidefinite relaxation of completely positive programs. Math. Program. Comput. 2, 1\u201319 (2010)","journal-title":"Math. Program. Comput."},{"key":"1095_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10589-007-9137-6","volume":"43","author":"S Burer","year":"2009","unstructured":"Burer, S., Vandenbussche, D.: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound. Comput. Optim. Appl. 43, 181\u2013195 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"1095_CR17","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2015.2497160","author":"C Chen","year":"2015","unstructured":"Chen, C., Atamt\u00fcrk, A., Oren, S.S.: Bound tightening for the alternating current optimal power flow problem. IEEE Trans. Power Syst. (2015). doi: 10.1109\/TPWRS.2015.2497160","journal-title":"IEEE Trans. Power Syst."},{"key":"1095_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s12532-011-0033-9","volume":"4","author":"J Chen","year":"2012","unstructured":"Chen, J., Burer, S.: Globally solving nonconvex quadratic programming problems via completely positive programming. Math. Program. Comput. 4, 33\u201352 (2012)","journal-title":"Math. Program. Comput."},{"key":"1095_CR19","unstructured":"Coffrin, C., Gordon, D., Scott, P.: NESTA, The NICTA Energy System Test Case Archive. arXiv:1411.0359 (2014)"},{"key":"1095_CR20","doi-asserted-by":"publisher","first-page":"2683","DOI":"10.1109\/TSP.2011.2128313","volume":"59","author":"A De Maio","year":"2011","unstructured":"De Maio, A., Huang, Y., Piezzo, M., Zhang, S., Farina, A.: Design of optimized radar codes with a peak to average power ratio constraint. IEEE Trans. Signal Proces. 59, 2683\u20132697 (2011)","journal-title":"IEEE Trans. Signal Proces."},{"key":"1095_CR21","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/S1052623400366218","volume":"11","author":"M Fukuda","year":"2001","unstructured":"Fukuda, M., Kojima, M., Murota, K., Nakata, K.: Exploiting sparsity in semidefinite programming via matrix completion I: general framework. SIAM J. Optim. 11, 647\u2013674 (2001)","journal-title":"SIAM J. Optim."},{"key":"1095_CR22","doi-asserted-by":"crossref","unstructured":"Gopalakrishnan, A., Raghunathan, A.U., Nikovski, D., Biegler, L.T.: Global optimization of optimal power flow using a branch & bound algorithm. In: IEEE 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 609\u2013616 (2012)","DOI":"10.1109\/Allerton.2012.6483274"},{"key":"1095_CR23","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","volume":"58","author":"R Grone","year":"1984","unstructured":"Grone, R., Johnson, C.R., S\u00e1, E.M., Wolkowicz, H.: Positive definite completions of partial Hermitian matrices. Linear Algebra Appl. 58, 109\u2013124 (1984)","journal-title":"Linear Algebra Appl."},{"key":"1095_CR24","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1109\/TSP.2013.2297683","volume":"62","author":"Y Huang","year":"2014","unstructured":"Huang, Y., Palomar, D.P.: Randomized algorithms for optimal solutions of double-sided QCQP with applications in signal processing. IEEE Trans. Signal Process. 62, 1093\u20131108 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"1095_CR25","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1287\/moor.1070.0268","volume":"32","author":"Y Huang","year":"2007","unstructured":"Huang, Y., Zhang, S.: Complex matrix decomposition and quadratic programming. Math. Oper. Res. 32, 758\u2013768 (2007)","journal-title":"Math. Oper. Res."},{"key":"1095_CR26","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1109\/TPWRS.2008.926439","volume":"23","author":"RA Jabr","year":"2008","unstructured":"Jabr, R.A.: Optimal power flow using an extended conic quadratic formulation. IEEE Trans. Power Syst. 23, 1000\u20131008 (2008)","journal-title":"IEEE Trans. Power Syst."},{"key":"1095_CR27","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1109\/TPWRS.2011.2170772","volume":"27","author":"RA Jabr","year":"2012","unstructured":"Jabr, R.A.: Exploiting sparsity in SDP relaxations of the OPF problem. IEEE Trans. Power Syst. 27, 1138\u20131139 (2012)","journal-title":"IEEE Trans. Power Syst."},{"key":"1095_CR28","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10589-014-9640-5","volume":"59","author":"B Jiang","year":"2014","unstructured":"Jiang, B., Li, Z., Zhang, S.: Approximation methods for complex polynomial optimization. Comput. Optim. Appl. 59, 219\u2013248 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"1095_CR29","unstructured":"Josz, C., Molzahn, D.K.: Moment\/Sum-of-Squares Hierarchy for Complex Polynomial Optimization. arXiv:1508.02068 (2015)"},{"key":"1095_CR30","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1109\/TPWRS.2015.2402640","volume":"31","author":"B Kocuk","year":"2016","unstructured":"Kocuk, B., Dey, S.S., Sun, X.A.: Inexactness of SDP relaxation and valid inequalities for optimal power flow. IEEE Trans. Power Syst. 31, 642\u2013651 (2016)","journal-title":"IEEE Trans. Power Syst."},{"key":"1095_CR31","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TPWRS.2011.2160974","volume":"27","author":"J Lavaei","year":"2012","unstructured":"Lavaei, J., Low, S.H.: Zero duality gap in optimal power flow problem. IEEE Trans. Power Syst. 27, 92\u2013107 (2012)","journal-title":"IEEE Trans. Power Syst."},{"key":"1095_CR32","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)","journal-title":"Math. Program."},{"key":"1095_CR33","doi-asserted-by":"crossref","unstructured":"Lofberg, J.: YALMIP: a toolbox for modeling and optimization in MATLAB. In: IEEE International Symposium on Computer Aided Control Systems Design, pp. 284\u2013289 (2004)","DOI":"10.1109\/CACSD.2004.1393890"},{"key":"1095_CR34","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"1095_CR35","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 1 convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"1095_CR36","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10898-012-9874-7","volume":"57","author":"R Misener","year":"2013","unstructured":"Misener, R., Floudas, C.A.: GloMIQO: global mixed-integer quadratic optimizer. J. Global Optim. 57, 3\u201350 (2013)","journal-title":"J. Global Optim."},{"key":"1095_CR37","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/10556788.2014.916287","volume":"30","author":"R Misener","year":"2015","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, 215\u2013249 (2015)","journal-title":"Optim. Methods Softw."},{"key":"1095_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TPWRS.2013.2285610","volume":"28","author":"DK Molzahn","year":"2013","unstructured":"Molzahn, D.K., Holzer, J.T., Lesieutre, B.C., DeMarco, C.L.: Implementation of a large-scale optimal power flow solver based on semidefinite programming. IEEE Trans. Power Syst. 28, 1\u201312 (2013)","journal-title":"IEEE Trans. Power Syst."},{"key":"1095_CR39","doi-asserted-by":"crossref","unstructured":"Petriu, D.C., Shen, H.: Applying the UML performance profile: graph grammar-based derivation of LQN models from UML specifications. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds.) Computer Performance Evaluation: Modelling Techniques and Tools, vol. 2324, pp. 159\u2013177. Springer, Berlin (2002)","DOI":"10.1007\/3-540-46029-2_10"},{"key":"1095_CR40","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1287\/opre.1110.1036","volume":"60","author":"DT Phan","year":"2012","unstructured":"Phan, D.T.: Lagrangian duality-based branch and bound algorithms for optimal power flow. Oper. Res. 60, 275\u2013285 (2012)","journal-title":"Oper. Res."},{"key":"1095_CR41","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. Global Optim. 13, 417\u2013432 (1998)","journal-title":"J. Global Optim."},{"key":"1095_CR42","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Global Optim. 8, 201\u2013205 (1996)","journal-title":"J. Global Optim."},{"key":"1095_CR43","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"HD Sherali","year":"1992","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Global Optim. 2, 101\u2013112 (1992)","journal-title":"J. Global Optim."},{"key":"1095_CR44","first-page":"6","volume":"25","author":"NZ Shor","year":"1987","unstructured":"Shor, N.Z.: Quadratic optimization problems. Soviet J. Circuits Syst. Sci. 25, 6 (1987)","journal-title":"Soviet J. Circuits Syst. Sci."},{"key":"1095_CR45","doi-asserted-by":"publisher","first-page":"2864","DOI":"10.1109\/TPAS.1984.318284","volume":"10","author":"DI Sun","year":"1984","unstructured":"Sun, D.I., Ashley, B., Brewer, B., Hughes, A., Tinney, W.F.: Optimal power flow by Newton approach. IEEE Trans. Power Appar. Syst. 10, 2864\u20132880 (1984)","journal-title":"IEEE Trans. Power Appar. Syst."},{"key":"1095_CR46","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/132","volume-title":"Topics in Random Matrix Theory","author":"T Tao","year":"2012","unstructured":"Tao, T.: Topics in Random Matrix Theory, vol. 132. American Mathematical Society, Providence (2012)"},{"key":"1095_CR47","unstructured":"The MathWorks. MATLAB User\u2019s Guide (1998)"},{"key":"1095_CR48","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106, 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"1095_CR49","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10107-013-0738-9","volume":"149","author":"I Waldspurger","year":"2015","unstructured":"Waldspurger, I., D\u2019Aspremont, A., Mallat, S.: Phase recovery, maxcut and complex semidefinite programming. Math. Program. 149, 47\u201381 (2015)","journal-title":"Math. Program."},{"key":"1095_CR50","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/TPWRS.2010.2051168","volume":"26","author":"RD Zimmerman","year":"2011","unstructured":"Zimmerman, R.D., Murillo-S\u00e1nchez, C.E., Thomas, R.J.: MATPOWER: steady-state operations, planning, and analysis tools for power systems research and education. IEEE Trans. Power Syst. 26, 12\u201319 (2011)","journal-title":"IEEE Trans. Power Syst."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1095-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1095-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1095-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T12:39:47Z","timestamp":1749818387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1095-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,10]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["1095"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1095-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,10]]},"assertion":[{"value":"15 August 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}