{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T12:03:39Z","timestamp":1773144219555,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T00:00:00Z","timestamp":1247011200000},"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":[[2011,4]]},"DOI":"10.1007\/s10589-009-9273-2","type":"journal-article","created":{"date-parts":[[2009,7,7]],"date-time":"2009-07-07T11:06:07Z","timestamp":1246964767000},"page":"653-673","source":"Crossref","is-referenced-by-count":3,"title":["Relaxing the optimality conditions of box QP"],"prefix":"10.1007","volume":"48","author":[{"given":"Samuel","family":"Burer","sequence":"first","affiliation":[]},{"given":"Jieqiu","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,7,8]]},"reference":[{"key":"9273_CR1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"2","author":"K.M. Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim. 2, 471\u2013484 (2009)","journal-title":"J. Global Optim."},{"key":"9273_CR2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10589-007-9137-6","volume":"2","author":"S. Burer","year":"2009","unstructured":"Burer, S., Vandenbussche, D.: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound. Comput. Optim. Appl. 2, 181\u2013195 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"9273_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-1-4757-2600-8_5","volume-title":"Developments in Global Optimization","author":"P. Angelis De","year":"1997","unstructured":"De Angelis, P., Pardalos, P., Toraldo, G.: Quadratic programming with box constraints. In: Bomze,\u00a0I.M., Csendes, T., Horst, R., Pardalos, P. (eds.) Developments in Global Optimization, pp. 73\u201394. Kluwer Academic, Norwell (1997)"},{"key":"9273_CR4","series-title":"Appl. Optim.","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-1-4613-0263-6_8","volume-title":"Trends in Industrial and Applied Mathematics","author":"N.I.M. Gould","year":"2002","unstructured":"Gould, N.I.M., Toint, P.L.: Numerical methods for large-scale non-convex quadratic programming. In: Trends in Industrial and Applied Mathematics, Amritsar, 2001. Appl. Optim., vol. 72, pp. 149\u2013179. Kluwer Academic, Dordrecht (2002)"},{"key":"9273_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02947-3","volume-title":"Global Optimization","author":"R. Horst","year":"1993","unstructured":"Horst, R., Tuy, H.: Global Optimization, second edition. Springer-Verlag, Berlin (1993). Deterministic Approaches","edition":"2"},{"key":"9273_CR6","unstructured":"L\u00f6fberg Yalmip, J.: A toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD Conference, Taipei, Taiwan (2004). URL http:\/\/control.ee.ethz.ch\/~joloef\/yalmip.php"},{"key":"9273_CR7","first-page":"363","volume-title":"Handbook of Semidefinite Programming","author":"Y. Nesterov","year":"2000","unstructured":"Nesterov, Y.: Global quadratic optimization via conic relaxation. In: Saigal, R., Vandenberghe, L., Wolkowicz, H. (eds.) Handbook of Semidefinite Programming, pp. 363\u2013386. Kluwer Academic, Dordrecht (2000)"},{"key":"9273_CR8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0898-1221(91)90163-X","volume":"21","author":"P. Pardalos","year":"1991","unstructured":"Pardalos, P.: Global optimization algorithms for linearly constrained indefinite quadratic problems. Comput. Math. Appl. 21, 87\u201397 (1991)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"9273_CR9","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"P.M. Pardalos","year":"1991","unstructured":"Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is NP-hard. J. Global Optim. 1(1), 15\u201322 (1991)","journal-title":"J. Global Optim."},{"key":"9273_CR10","volume-title":"A Reformulation-Linearization Technique (RLT) for Solving Discrete and Continuous Nonconvex Problems","author":"H.D. Sherali","year":"1997","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique (RLT) for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic, Dordrecht (1997)"},{"key":"9273_CR11","first-page":"1","volume":"25","author":"N. Shor","year":"1987","unstructured":"Shor, N.: Quadratic optimization problems. Sov. J. Comput. Syst. Sci. 25, 1\u201311 (1987). Originally published in Tekh. Kibern. 1, 128\u2013139 (1987)","journal-title":"Sov. J. Comput. Syst. Sci."},{"issue":"1\u20134","key":"9273_CR12","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\/12","author":"J.F. Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\/12(1\u20134), 625\u2013653 (1999). URL http:\/\/sedumi.mcmaster.ca\/","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"9273_CR13","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10107-004-0549-0","volume":"102","author":"D. Vandenbussche","year":"2005","unstructured":"Vandenbussche, D., Nemhauser, G.: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102(3), 531\u2013557 (2005a)","journal-title":"Math. Program."},{"issue":"3","key":"9273_CR14","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s10107-004-0550-7","volume":"102","author":"D. Vandenbussche","year":"2005","unstructured":"Vandenbussche, D., Nemhauser, G.: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102(3), 559\u2013575 (2005b)","journal-title":"Math. Program."},{"issue":"2, Ser. A","key":"9273_CR15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107980012a","volume":"84","author":"Y. Ye","year":"1999","unstructured":"Ye, Y.: Approximating quadratic programming with bound and quadratic constraints. Math. Program. 84(2, Ser. A), 219\u2013226 (1999)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9273-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-009-9273-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9273-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:37Z","timestamp":1559288197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-009-9273-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,8]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9273"],"URL":"https:\/\/doi.org\/10.1007\/s10589-009-9273-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,8]]}}}