{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T03:54:41Z","timestamp":1727063681166},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,1,20]],"date-time":"2015-01-20T00:00:00Z","timestamp":1421712000000},"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":["J Glob Optim"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s10898-015-0269-4","type":"journal-article","created":{"date-parts":[[2015,1,19]],"date-time":"2015-01-19T11:14:51Z","timestamp":1421666091000},"page":"37-59","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Analysis of copositive optimization based linear programming bounds on standard quadratic optimization"],"prefix":"10.1007","volume":"63","author":[{"given":"Gizem","family":"Sa\u011fol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. Alper","family":"Y\u0131ld\u0131r\u0131m","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,20]]},"reference":[{"key":"269_CR1","doi-asserted-by":"crossref","unstructured":"Berman, A., Shaked-Monderer, N.: Completely Positive Matrices. World Scientific, River Edge, NJ (2003)","DOI":"10.1142\/5273"},{"issue":"4","key":"269_CR2","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1023\/A:1008369322970","volume":"13","author":"IM Bomze","year":"1998","unstructured":"Bomze, I.M.: On standard quadratic optimization problems. J. Global Optim. 13(4), 369\u2013387 (1998)","journal-title":"J. Global Optim."},{"key":"269_CR3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M., de Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Optim. 24, 163\u2013185 (2002)","journal-title":"J. Global Optim."},{"issue":"4","key":"269_CR4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"IM Bomze","year":"2000","unstructured":"Bomze, I.M., D\u00fcr, M., de Klerk, E., Roos, C., Quist, A., Terlaky, T.: On copositive programming and standard quadratic optimization problems. J. Global Optim. 18(4), 301\u2013320 (2000)","journal-title":"J. Global Optim."},{"key":"269_CR5","first-page":"2","volume":"89","author":"IM Bomze","year":"2012","unstructured":"Bomze, I.M., D\u00fcr, M., Teo, C.-P.: Copositive optimization. Optima 89, 2\u20138 (2012)","journal-title":"Optima"},{"issue":"1","key":"269_CR6","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/070711815","volume":"20","author":"S Bundfuss","year":"2009","unstructured":"Bundfuss, S., D\u00fcr, M.: An adaptive linear approximation algorithm for copositive programs. SIAM J. Optim. 20(1), 30\u201353 (2009)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"269_CR7","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(2), 479\u2013495 (2009)","journal-title":"Math. Program."},{"issue":"4","key":"269_CR8","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":"269_CR9","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.jmaa.2011.03.005","volume":"380","author":"PJC Dickinson","year":"2011","unstructured":"Dickinson, P.J.C.: Geometry of the copositive and completely positive cones. J. Math. Anal. Appl. 380, 377\u2013395 (2011)","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"269_CR10","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10589-013-9594-z","volume":"57","author":"PJC Dickinson","year":"2014","unstructured":"Dickinson, P.J.C., Gijben, L.: On the computational complexity of membership problems for the completely positive cone and its dual. Comput. Optim. Appl. 57(2), 403\u2013415 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"269_CR11","first-page":"48","volume":"17","author":"M D\u00fcr","year":"2008","unstructured":"D\u00fcr, M., Still, G.: Interior points of the completely positive cone. Electr. J. Linear Algebra 17, 48\u201353 (2008)","journal-title":"Electr. J. Linear Algebra"},{"issue":"3","key":"269_CR12","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"269_CR13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10107-013-0632-5","volume":"144","author":"JB Lasserre","year":"2014","unstructured":"Lasserre, J.B.: New approximations for the cone of copositive matrices and its dual. Math. Program. 144(1\u20132), 265\u2013276 (2014)","journal-title":"Math. Program."},{"key":"269_CR14","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can. J. Math. 17, 533\u2013540 (1965)","journal-title":"Can. J. Math."},{"issue":"2","key":"269_CR15","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"KG Murty","year":"1987","unstructured":"Murty, K.G., Kabadi, S.N.: Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39(2), 117\u2013129 (1987)","journal-title":"Math. Program."},{"key":"269_CR16","unstructured":"Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology, Pasadena, CA (2000)"},{"issue":"1","key":"269_CR17","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/05064401X","volume":"18","author":"J Pe\u00f1a","year":"2007","unstructured":"Pe\u00f1a, J., Vera, J., Zuluaga, L.F.: Computing the stability number of a graph via linear and semidefinite programming. SIAM J. Optim. 18(1), 87\u2013105 (2007)","journal-title":"SIAM J. Optim."},{"key":"269_CR18","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s10898-011-9766-2","volume":"52","author":"J Sponsel","year":"2012","unstructured":"Sponsel, J., Bundfuss, S., D\u00fcr, M.: An improved algorithm to test copositivity. J. Global Optim. 52, 537\u2013551 (2012)","journal-title":"J. Global Optim."},{"issue":"2","key":"269_CR19","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0190(90)90100-C","volume":"36","author":"S Vavasis","year":"1990","unstructured":"Vavasis, S.: Quadratic programming is in NP. Inf. Process. Lett. 36(2), 73\u201377 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"269_CR20","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1080\/10556788.2010.540014","volume":"27","author":"EA Y\u0131ld\u0131r\u0131m","year":"2012","unstructured":"Y\u0131ld\u0131r\u0131m, E.A.: On the accuracy of uniform polyhedral approximations of the copositive cone. Optim. Methods Softw. 27(1), 155\u2013173 (2012)","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-015-0269-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-015-0269-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0269-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:59:08Z","timestamp":1559278748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-015-0269-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,20]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["269"],"URL":"https:\/\/doi.org\/10.1007\/s10898-015-0269-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,20]]}}}