{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:52:08Z","timestamp":1648641128642},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,12,12]],"date-time":"2012-12-12T00:00:00Z","timestamp":1355270400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10589-012-9522-7","type":"journal-article","created":{"date-parts":[[2012,12,11]],"date-time":"2012-12-11T17:50:31Z","timestamp":1355248231000},"page":"379-398","source":"Crossref","is-referenced-by-count":2,"title":["Tightening a copositive relaxation for standard quadratic optimization problems"],"prefix":"10.1007","volume":"55","author":[{"given":"Yong","family":"Xia","sequence":"first","affiliation":[]},{"given":"Ruey-Lin","family":"Sheu","sequence":"additional","affiliation":[]},{"given":"Xiaoling","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Duan","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,12]]},"reference":[{"key":"9522_CR1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10898-004-4312-0","volume":"33","author":"K.M. Anstreicher","year":"2005","unstructured":"Anstreicher, K.M., Burer, S.: D. C. versus copositive bounds for standard QP. J. Glob. Optim. 33, 299\u2013312 (2005)","journal-title":"J. Glob. Optim."},{"key":"9522_CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-010-0355-9","volume":"124","author":"K.M. 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":"9522_CR3","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1023\/A:1008369322970","volume":"13","author":"I.M. Bomze","year":"1998","unstructured":"Bomze, I.M.: On standard quadratic optimization problems. J. Glob. Optim. 13, 369\u2013387 (1998)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"9522_CR4","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. J. Glob. Optim. 24(2), 163\u2013185 (2002)","journal-title":"J. Glob. Optim."},{"key":"9522_CR5","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."},{"key":"9522_CR6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10107-007-0138-0","volume":"115","author":"I.M. Bomze","year":"2008","unstructured":"Bomze, I.M., Locatelli, M., Tardella, F.: New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability. Math. Program. 115, 31\u201364 (2008)","journal-title":"Math. Program."},{"key":"9522_CR7","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10107-008-0233-x","volume":"121","author":"I. Dukanovic","year":"2010","unstructured":"Dukanovic, I., Rendl, F.: Copositive programming motivated bounds on the stability and the chromatic numbers. Math. Program. 121, 249\u2013268 (2010)","journal-title":"Math. Program."},{"key":"9522_CR8","unstructured":"Grant, M., Boyd, S.C.V.: Matlab software for disciplined convex programming, version\u00a01. 21 (2010). http:\/\/cvxr.com\/cvx"},{"key":"9522_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)"},{"key":"9522_CR10","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0927-0507(05)12008-8","volume-title":"Handbook on Discrete Optimization","author":"M. Laurent","year":"2005","unstructured":"Laurent, M., Rendl, F.: Semidefinite programming and integer programming. In: Weismantel, R., Aardal, K., Nemhauser, G. (eds.) Handbook on Discrete Optimization, pp. 393\u2013514. Elsevier, Amsterdam (2005)"},{"key":"9522_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Trans. Inf. Theory 25, 1\u20137 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9522_CR12","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1137\/S0895480104429181","volume":"19","author":"C. Luz","year":"2005","unstructured":"Luz, C., Schrijver, A.: A convex quadratic characterization of the Lov\u00e1sz theta number. SIAM J. Discrete Math. 19(2), 382\u2013387 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"9522_CR13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1017\/S0013091500014681","volume":"13","author":"J.E. Maxfield","year":"1963","unstructured":"Maxfield, J.E., Minc, H.: On the matrix equation X\u2032X=A. Proc. Edinb. Math. Soc. 13, 125\u2013129 (1963)","journal-title":"Proc. Edinb. Math. Soc."},{"key":"9522_CR14","first-page":"134","volume":"3","author":"R.J. McEliece","year":"1978","unstructured":"McEliece, R.J., Rodemich, E.R., Rumsey, H.C.: The Lov\u00e1sz\u2019 bound and some generalizations. J. Comb. Inf. Syst. Sci. 3, 134\u2013152 (1978)","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"9522_CR15","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719512","volume-title":"Matrix Analysis and Applied Linear Algebra","author":"C.D. Meyer","year":"2000","unstructured":"Meyer, C.D.: Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia (2000)"},{"key":"9522_CR16","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T.S. 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."},{"key":"9522_CR17","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Methods in Convex Programming","author":"Y. Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovsky, A.: Interior-Point Polynomial Methods in Convex Programming. SIAM, Philadelphia (1994)"},{"key":"9522_CR18","unstructured":"Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D. thesis, California Institute of Technology, CA (2000)"},{"key":"9522_CR19","first-page":"127","volume":"9","author":"B. Rosgen","year":"2007","unstructured":"Rosgen, B., Stewart, L.: Complexity results on graphs with few cliques. Discrete Math. Theor. Comput. Sci. 9, 127\u2013136 (2007)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"9522_CR20","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TIT.1979.1056072","volume":"25","author":"A. Schrijver","year":"1979","unstructured":"Schrijver, A.: A comparison of the Delsarte and Lov\u00e1sz bounds. IEEE Trans. Inf. Theory 25, 425\u2013429 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9522_CR21","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10898-011-9683-4","volume":"53","author":"X.L. Sun","year":"2012","unstructured":"Sun, X.L., Liu, C.L., Li, D., Gao, J.J.: On duality gap in binary quadratic programming. J. Glob. Optim. 53, 255\u2013269 (2012)","journal-title":"J. Glob. Optim."},{"key":"9522_CR22","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6, 505\u2013517 (1977)","journal-title":"SIAM J. Comput."},{"key":"9522_CR23","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38, 49\u201395 (1996)","journal-title":"SIAM Rev."},{"key":"9522_CR24","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1137\/100802153","volume":"21","author":"Y. Xia","year":"2011","unstructured":"Xia, Y., Sun, X.L., Li, D., Zheng, X.J.: On the reduction of duality gap in box constrained nonconvex quadratic program. SIAM J. Optim. 21, 706\u2013729 (2011)","journal-title":"SIAM J. Optim."},{"key":"9522_CR25","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1287\/moor.1100.0472","volume":"35","author":"X.J. Zheng","year":"2010","unstructured":"Zheng, X.J., Sun, X.L., Li, D., Xia, Y.: Duality gap estimation of linear equality constrained binary quadratic programming. Math. Oper. Res. 35, 864\u2013880 (2010)","journal-title":"Math. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9522-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-012-9522-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9522-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:43Z","timestamp":1559302603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-012-9522-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,12]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["9522"],"URL":"https:\/\/doi.org\/10.1007\/s10589-012-9522-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,12]]}}}