{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T20:56:14Z","timestamp":1777323374323,"version":"3.51.4"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,1,22]],"date-time":"2016-01-22T00:00:00Z","timestamp":1453420800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s11590-016-1001-0","type":"journal-article","created":{"date-parts":[[2016,1,22]],"date-time":"2016-01-22T05:59:30Z","timestamp":1453442370000},"page":"1141-1151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Exactness conditions for an SDP relaxation of the extended trust region problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Marco","family":"Locatelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,22]]},"reference":[{"key":"1001_CR1","doi-asserted-by":"crossref","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)","journal-title":"Math. Program."},{"key":"1001_CR2","doi-asserted-by":"crossref","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)","journal-title":"Math. Program."},{"key":"1001_CR3","doi-asserted-by":"crossref","unstructured":"Bienstock, D., Michalka, A.: Polynomial solvability of variants of the trust-region subproblem. In: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA14, pp. 380\u2013390 (2014)","DOI":"10.1137\/1.9781611973402.28"},{"issue":"3","key":"1001_CR4","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1137\/140987997","volume":"25","author":"IM Bomze","year":"2015","unstructured":"Bomze, I.M.: Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained QPs. SIAM J. Optim. 25(3), 1249\u20131275 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1001_CR5","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1137\/110826862","volume":"23","author":"S Burer","year":"2013","unstructured":"Burer, S., Anstreicher, K.: Second-order cone constraints for extended trust-region subproblems. SIAM J. Optim. 23(1), 432\u2013451 (2013)","journal-title":"SIAM J. Optim."},{"key":"1001_CR6","doi-asserted-by":"crossref","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, 253\u2013264 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"1001_CR7","doi-asserted-by":"crossref","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(1), 33\u201352 (2012)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"1001_CR8","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/070679041","volume":"19","author":"S He","year":"2008","unstructured":"He, S., Luo, Z.-Q., Nie, J., Zhang, S.: Semidefinite relaxation bounds for indefinite homogeneous quadratic optimization. SIAM J. Optim. 19(2), 503\u2013523 (2008)","journal-title":"SIAM J. Optim."},{"key":"1001_CR9","unstructured":"Hsia, Y., Sheu, R.-L.: Trust region subproblem with a fixed number of additional linear inequality constraints has polynomial complexity. Available at: arXiv:1312.1398"},{"key":"1001_CR10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10107-013-0716-2","volume":"147","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar, V., Li, G.Y.: Trust-Region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. Math. Program. 147, 171\u2013206 (2014)","journal-title":"Math. Program."},{"key":"1001_CR11","doi-asserted-by":"crossref","unstructured":"Kim, S., Kojima, M., Toh, K.-C.: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems. Math. Program. (to appear) (2016)","DOI":"10.1007\/s10107-015-0874-5"},{"key":"1001_CR12","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.orl.2014.12.002","volume":"43","author":"M Locatelli","year":"2015","unstructured":"Locatelli, M.: Some results for quadratic problems with one or two quadratic constraints. Oper. Res. Lett. 43, 126\u2013131 (2015)","journal-title":"Oper. Res. Lett."},{"key":"1001_CR13","doi-asserted-by":"crossref","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, 246\u2013267 (2003)","journal-title":"Math. Oper. Res."},{"key":"1001_CR14","doi-asserted-by":"crossref","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, 245\u2013267 (2003)","journal-title":"SIAM J. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1001-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1001-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1001-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:44Z","timestamp":1559409104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1001-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,22]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["1001"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1001-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,22]]}}}