{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T15:15:04Z","timestamp":1721229304673},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,8]],"date-time":"2022-01-08T00:00:00Z","timestamp":1641600000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,8]],"date-time":"2022-01-08T00:00:00Z","timestamp":1641600000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10107-021-01737-9","type":"journal-article","created":{"date-parts":[[2022,1,8]],"date-time":"2022-01-08T00:03:13Z","timestamp":1641600193000},"page":"281-306","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow"],"prefix":"10.1007","volume":"197","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-1188-1056","authenticated-orcid":false,"given":"Anders","family":"Eltved","sequence":"first","affiliation":[]},{"given":"Samuel","family":"Burer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,8]]},"reference":[{"issue":"1","key":"1737_CR1","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1137\/16M1078859","volume":"27","author":"KM Anstreicher","year":"2017","unstructured":"Anstreicher, K.M.: Kronecker product constraints with an application to the two-trust-region subproblem. SIAM J. Optim. 27(1), 368\u2013378 (2017)","journal-title":"SIAM J. Optim."},{"key":"1737_CR2","unstructured":"Argue, C.J., K\u0131l\u0131n\u00e7-Karzan, F., Wang, A.L.: Necessary and sufficient conditions for rank-one generated cones. Technical report (2020)"},{"issue":"1","key":"1737_CR3","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/15M1009871","volume":"26","author":"D Bienstock","year":"2016","unstructured":"Bienstock, D.: A note on polynomial solvability of the CDT problem. SIAM J. Optim. 26(1), 488\u2013498 (2016)","journal-title":"SIAM J. Optim."},{"issue":"2, Ser. A","key":"1737_CR4","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120(2, Ser. A), 479\u2013495 (2009)","journal-title":"Math. Program."},{"issue":"1","key":"1737_CR5","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1137\/110826862","volume":"23","author":"S Burer","year":"2013","unstructured":"Burer, S., Anstreicher, K.M.: Second-order-cone constraints for extended trust-region subproblems. SIAM J. Optim. 23(1), 432\u2013451 (2013)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1737_CR6","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/080729529","volume":"20","author":"S Burer","year":"2009","unstructured":"Burer, S., Letchford, A.N.: On nonconvex quadratic programming with box constraints. SIAM J. Optim. 20(2), 1073\u20131089 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132, Ser. A","key":"1737_CR7","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\u20132, Ser. A), 253\u2013264 (2015)","journal-title":"Math. Program."},{"key":"1737_CR8","doi-asserted-by":"crossref","unstructured":"Celis, M.R., Dennis, J.E., Tapia, R.A.: A trust region strategy for nonlinear equality constrained optimization. In: Numerical Optimization, 1984 (Boulder, Colorado, 1984), pp. 71\u201382. SIAM, Philadelphia (1985)","DOI":"10.21236\/ADA454933"},{"issue":"2, Ser. A","key":"1737_CR9","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(2, Ser. A), 549\u2013577 (2017)","journal-title":"Math. Program."},{"key":"1737_CR10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods. MPS\/SIAM Series on Optimization","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. MPS\/SIAM Series on Optimization. SIAM, Philadelphia (2000)"},{"key":"1737_CR11","unstructured":"CVX Research, Inc.: CVX: Matlab software for disciplined convex programming, version 2.1. http:\/\/cvxr.com\/cvx (December 2018)"},{"key":"1737_CR12","unstructured":"Eltved, A.: Convex Relaxation Techniques for Nonlinear Optimization. PhD thesis, Technical University of Denmark (2021)"},{"issue":"2","key":"1737_CR13","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10898-019-00793-y","volume":"75","author":"R Jiang","year":"2019","unstructured":"Jiang, R., Li, D.: Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming. J. Global Optim. 75(2), 461\u2013494 (2019)","journal-title":"J. Global Optim."},{"key":"1737_CR14","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3):796\u2013817 (2000\/01)","DOI":"10.1137\/S1052623400366802"},{"issue":"1","key":"1737_CR15","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1109\/TCNS.2014.2309732","volume":"1","author":"SH Low","year":"2014","unstructured":"Low, S.H.: Convex relaxation of optimal power flow\u2014part I: formulations and equivalence. IEEE Trans. Control Netw. Syst. 1(1), 15\u201327 (2014)","journal-title":"IEEE Trans. Control Netw. Syst."},{"issue":"2","key":"1737_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1109\/TCNS.2014.2323634","volume":"1","author":"SH Low","year":"2014","unstructured":"Low, S.H.: Convex relaxation of optimal power flow\u2014part II: exactness. IEEE Trans. Control Netw. Syst. 1(2), 177\u2013189 (2014)","journal-title":"IEEE Trans. Control Netw. Syst."},{"key":"1737_CR17","unstructured":"MOSEK ApS: The MOSEK optimization toolbox for MATLAB manual. Version 9.0.105 (2019)"},{"key":"1737_CR18","volume-title":"Nonconvex Optimization and Its Applications","author":"HD Sherali","year":"1999","unstructured":"Sherali, H.D., Adams, W.P.: A reformulation\u2013linearization technique for solving discrete and continuous nonconvex problems. In: Pardalos, P., Birge, J.R., Du, D.Z., Floudas, C.A., Mockus, J., Sherali, H.D., Stavroulakis, G. (eds.) Nonconvex Optimization and Its Applications, vol. 31. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"1737_CR19","first-page":"1","volume":"25","author":"NZ Shor","year":"1987","unstructured":"Shor, N.Z.: Quadratic optimization problems. Soviet J. Comput. Syst. Sci. 25, 1\u201311 (1987)","journal-title":"Soviet J. Comput. Syst. Sci."},{"issue":"2","key":"1737_CR20","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1137\/0805016","volume":"5","author":"RJ Stern","year":"1995","unstructured":"Stern, R.J., Wolkowicz, H.: Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations. SIAM J. Optim. 5(2), 286\u2013313 (1995)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1737_CR21","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)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1737_CR22","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/S105262340139001X","volume":"14","author":"Y Ye","year":"2003","unstructured":"Ye, Y., Zhang, S.: New results on quadratic minimization. SIAM J. Optim. 14(1), 245\u2013267 (2003)","journal-title":"SIAM J. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01737-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01737-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01737-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T01:06:26Z","timestamp":1674349586000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01737-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,8]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1737"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01737-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,8]]},"assertion":[{"value":"5 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}