{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T11:56:09Z","timestamp":1726228569759},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T00:00:00Z","timestamp":1321401600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s12532-011-0033-9","type":"journal-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T14:04:31Z","timestamp":1321452271000},"page":"33-52","source":"Crossref","is-referenced-by-count":71,"title":["Globally solving nonconvex quadratic programming problems via completely positive programming"],"prefix":"10.1007","volume":"4","author":[{"given":"Jieqiu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Samuel","family":"Burer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,16]]},"reference":[{"key":"33_CR1","unstructured":"Belotti, P.: Couenne: a user\u2019s manual. Technical report, Clemson University. http:\/\/projects.coin-or.org\/Couenne\/browser\/trunk\/Couenne\/doc\/couenne-user-manual.pdf (2010)"},{"key":"33_CR2","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24(4\u20135), 597\u2013634 (2009). http:\/\/www.optimization-online.org\/DB_HTML\/2008\/08\/2059.html"},{"issue":"2","key":"33_CR3","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":"1","key":"33_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-010-0010-8","volume":"2","author":"S. Burer","year":"2010","unstructured":"Burer S.: Optimizing a polyhedral-semidefinite relaxation of completely positive programs. Math. Prog. Comp. 2(1), 1\u201319 (2010)","journal-title":"Math. Prog. Comp."},{"issue":"3","key":"33_CR5","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1137\/040609574","volume":"16","author":"S. Burer","year":"2006","unstructured":"Burer S., Vandenbussche D.: Solving lift-and-project relaxations of binary integer programs. SIAM J. Optim. 16(3), 726\u2013750 (2006)","journal-title":"SIAM J. Optim."},{"issue":"2, Ser. A","key":"33_CR6","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10107-006-0080-6","volume":"113","author":"S. Burer","year":"2008","unstructured":"Burer S., Vandenbussche D.: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Program. 113(2, Ser. A), 259\u2013282 (2008)","journal-title":"Math. Program."},{"issue":"2","key":"33_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10589-007-9137-6","volume":"43","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. 43(2), 181\u2013195 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"33_CR8","unstructured":"Celis, M.R., Dennis, J.E., Tapia, R.A.: A trust region strategy for nonlinear equality constrained optimization. In: Numerical Optimization, 1984 (Boulder, Colo., 1984), pp. 71\u201382. SIAM, Philadelphia (1985)"},{"issue":"2, Ser. A","key":"33_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E.D. Dolan","year":"2002","unstructured":"Dolan E.D., Mor\u00e9 J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2, Ser. A), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"33_CR10","unstructured":"Globallib: Gamsworld global optimization library. http:\/\/www.gamsworld.org\/global\/globallib.htm"},{"issue":"4","key":"33_CR11","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"N. Gould","year":"2003","unstructured":"Gould N., Orban D., Toint P.L.: CUTEr (and SifDec): a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"33_CR12","doi-asserted-by":"crossref","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, Dordrecht (2002)","DOI":"10.1007\/978-1-4613-0263-6_8"},{"issue":"1","key":"33_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01442196","volume":"13","author":"Y. Lin","year":"1985","unstructured":"Lin Y., Cryer C.W.: An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems. Appl. Math. Optim. 13(1), 1\u201317 (1985)","journal-title":"Appl. Math. Optim."},{"key":"33_CR14","first-page":"244","volume":"25","author":"F.A. Lootsma","year":"1970","unstructured":"Lootsma F.A., Pearson J.D.: An indefinite-quadratic-programming model for a continuous-production problem. Philips Res. Rep. 25, 244\u2013254 (1970)","journal-title":"Philips Res. Rep."},{"key":"33_CR15","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz L., Schrijver A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"33_CR16","unstructured":"MathWorks: MATLAB Reference Guide. The MathWorks Inc., Natick (2010)"},{"issue":"4","key":"33_CR17","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01396045","volume":"55","author":"J.J. Mor\u00e9","year":"1989","unstructured":"Mor\u00e9 J.J., Toraldo G.: Algorithms for bound constrained quadratic programming problems. Numer. Math. 55(4), 377\u2013400 (1989)","journal-title":"Numer. Math."},{"key":"33_CR18","doi-asserted-by":"crossref","first-page":"3212","DOI":"10.1016\/j.csda.2009.09.037","volume":"54","author":"T. Nguyen","year":"2010","unstructured":"Nguyen T., Welsch R.: Outlier detection and least trimmed squares approximation using semi-definite programming. Comput. Stat. Data Anal. 54, 3212\u20133226 (2010)","journal-title":"Comput. Stat. Data Anal."},{"key":"33_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"1999","unstructured":"Nocedal J., Wright S.: Numerical Optimization. Springer, New York (1999)"},{"key":"33_CR20","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":"33_CR21","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."},{"issue":"2","key":"33_CR22","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"N.V. Sahinidis","year":"1996","unstructured":"Sahinidis N.V.: BARON: a general purpose global optimization software package. J. Global Optim. 8(2), 201\u2013205 (1996)","journal-title":"J. Global Optim."},{"key":"33_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Nonconvex Optimization and its Applications, vol. 31","author":"H.D. Sherali","year":"1999","unstructured":"Sherali H.D., Adams W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Nonconvex Optimization and its Applications, vol. 31. Kluwer, Dordrecht (1999)"},{"issue":"2","key":"33_CR24","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/375827.375840","volume":"48","author":"M. Skutella","year":"2001","unstructured":"Skutella M.: Convex quadratic and semidefinite programming relaxations in scheduling. J. ACM 48(2), 206\u2013242 (2001)","journal-title":"J. ACM"},{"issue":"3","key":"33_CR25","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 (2005)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-011-0033-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-011-0033-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-011-0033-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T16:36:55Z","timestamp":1560962215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-011-0033-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,16]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["33"],"URL":"https:\/\/doi.org\/10.1007\/s12532-011-0033-9","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,16]]}}}