{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T15:48:47Z","timestamp":1648655327957},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,11,27]],"date-time":"2012-11-27T00:00:00Z","timestamp":1353974400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10898-012-0013-2","type":"journal-article","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T08:16:46Z","timestamp":1353917806000},"page":"1139-1146","source":"Crossref","is-referenced-by-count":1,"title":["A note on set-semidefinite relaxations of nonconvex quadratic programs"],"prefix":"10.1007","volume":"57","author":[{"given":"Faizan","family":"Ahmed","sequence":"first","affiliation":[]},{"given":"Georg","family":"Still","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,27]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0024-3795(95)00165-4","volume":"248","author":"I.M. Bomze","year":"1996","unstructured":"Bomze I.M.: Block pivoting and shortcut strategies for detecting copositivity. Linear Algebra Appl. 248, 161\u2013184 (1996)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"13_CR2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"I.M. Bomze","year":"2002","unstructured":"Bomze I.M., De Klerk E.: Solving standard quadratic optimization problems via linear semidefinite and copositive programming. Dedicated to Professor Naum Z. Shor on his 65th birthday. J. Glob. Optim. 24(2), 163\u2013185 (2002)","journal-title":"J. Glob. Optim."},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"I.M. Bomze","year":"2000","unstructured":"Bomze I.M., D\u00fcr M., de Klerk E., Roos C., Quist A.J., Terlaky T.: On copositive programming and standard quadratic optimization problems. J. Glob. Optim. 18, 301\u2013320 (2000)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"13_CR4","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s11590-010-0174-1","volume":"4","author":"I.M. Bomze","year":"2010","unstructured":"Bomze I.M., Jarre F.: A note on Burer\u2019s copositive representation of mixed-binary QPs. Optim. Lett. 4(3), 465\u2013472 (2010)","journal-title":"Optim. Lett."},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10589-009-9243-8","volume":"45","author":"I.M. Bomze","year":"2010","unstructured":"Bomze I.M., Schachinger W.: Multi-standard quadratic optimization: interior point methods and cone programming reformulation. Comput. Optim. Appl. 45, 237\u2013256 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"13_CR6","doi-asserted-by":"crossref","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, 479\u2013495 (2009)","journal-title":"Math. Program."},{"issue":"3","key":"13_CR7","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.orl.2012.02.001","volume":"40","author":"S. Burer","year":"2012","unstructured":"Burer S., Dong H.: Representing quadratically constrained quadratic programs as generalized copositive programs. Oper. Res. Lett. 40(3), 203\u2013206 (2012)","journal-title":"Oper. Res. Lett."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Burer, S.: Copositive programming. In: Anjos, M., Lasserre, J.B. (eds.) Handbook of Semidefinite, Cone and Polynomial Optimization (to appear) (2010)","DOI":"10.1007\/978-1-4614-0769-0_8"},{"issue":"4","key":"13_CR9","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E. Klerk de","year":"2002","unstructured":"de Klerk E., Pasechnik D.V.: Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12(4), 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"key":"13_CR10","first-page":"320","volume-title":"Optimization and its Applications in Engineering","author":"M. D\u00fcr","year":"2010","unstructured":"D\u00fcr M.: Copositive programming\u2014a survey, in Recent Advances. In: Diehl, M., Glineur, F., Jarlebring, E., Michiels, W. (eds) Optimization and its Applications in Engineering, pp. 320. Springer, Berlin (2010)"},{"issue":"4","key":"13_CR11","first-page":"767","volume":"15","author":"G. Eichfelder","year":"2008","unstructured":"Eichfelder G., Jahn J.: Set-semidefinite optimization. J. Convex Anal. 15(4), 767\u2013801 (2008)","journal-title":"J. Convex Anal."},{"issue":"3","key":"13_CR12","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1137\/S1052623498336450","volume":"10","author":"M. Kojima","year":"2000","unstructured":"Kojima M., Tun\u00e7el L.: Cones of matrices and successive convex relaxations of nonconvex sets. SIAM J. Optim. 10(3), 750\u2013778 (2000)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"13_CR13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/050637467","volume":"18","author":"J. Povh","year":"2007","unstructured":"Povh J., Rendl F.: A copositive programming approach to graph partitioning. SIAM J. Optim. 18(1), 223\u2013241 (2007)","journal-title":"SIAM J. Optim."},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"3231241","DOI":"10.1016\/j.disopt.2009.01.002","volume":"6","author":"J. Povh","year":"2009","unstructured":"Povh J., Rendl F.: Copositive and semidefinite relaxations of the quadratic assignment problem. Discret. Optim. 6, 3231241 (2009)","journal-title":"Discret. Optim."},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1137\/S0363012993251894","volume":"34","author":"J.C. Preisig","year":"1996","unstructured":"Preisig J.C.: Copositivity and the minimization of quadratic functions with nonnegativity and quadratic equality constraints. SIAM J. Control Optim. 34, 1135\u20131150 (1996)","journal-title":"SIAM J. Control Optim."},{"key":"13_CR16","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1080\/10556789808805692","volume":"9","author":"A.J. Quist","year":"1998","unstructured":"Quist A.J., De Klerk E., Roos C., Terlaky T.: Copositive relaxation for general quadratic programming. Optim. Methods Softw. 9, 185\u2013208 (1998)","journal-title":"Optim. Methods Softw."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-0013-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-0013-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-0013-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T23:27:19Z","timestamp":1562369239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-0013-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,27]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["13"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-0013-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,27]]}}}