{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:50:21Z","timestamp":1783011021857,"version":"3.54.6"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T00:00:00Z","timestamp":1337472000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10107-012-0543-x","type":"journal-article","created":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T12:56:50Z","timestamp":1337518610000},"page":"365-400","source":"Crossref","is-referenced-by-count":18,"title":["Copositivity detection by difference-of-convex decomposition and \u03c9-subdivision"],"prefix":"10.1007","volume":"138","author":[{"given":"Immanuel M.","family":"Bomze","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabriele","family":"Eichfelder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,5,20]]},"reference":[{"key":"543_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0024-3795(94)00161-6","volume":"220","author":"L.E. Andersson","year":"1995","unstructured":"Andersson L.E., Chang G., Elfving T.: Criteria for copositive matrices using simplices and barycentric coordinates. Linear Algebra Appl. 220, 9\u201330 (1995)","journal-title":"Linear Algebra Appl."},{"key":"543_CR2","first-page":"7","volume":"1","author":"I.M. Bomze","year":"1992","unstructured":"Bomze I.M.: Copositivity conditions for global optimality in indefinite quadratic programming problems. Czechoslov. J. Oper. Res. 1, 7\u201319 (1992)","journal-title":"Czechoslov. J. Oper. Res."},{"key":"543_CR3","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."},{"key":"543_CR4","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1023\/A:1008297330705","volume":"11","author":"I.M. Bomze","year":"1997","unstructured":"Bomze I.M.: Global escape strategies for maximizing quadratic forms over a simplex. J. Glob. Optim. 11, 325\u2013338 (1997)","journal-title":"J. Glob. Optim."},{"key":"543_CR5","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."},{"key":"543_CR6","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1137\/S0895479898341487","volume":"21","author":"I.M. Bomze","year":"2000","unstructured":"Bomze I.M.: Linear-time copositivity detection for tridiagonal matrices and extension to block-tridiagonality. SIAM J. Matrix Anal. Appl. 21, 840\u2013848 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"543_CR7","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.laa.2008.02.003","volume":"429","author":"I.M. Bomze","year":"2008","unstructured":"Bomze I.M.: Perron-Frobenius property of copositive matrices, and a block copositivity criterion. Linear Algebra Appl. 429, 68\u201371 (2008)","journal-title":"Linear Algebra Appl."},{"key":"543_CR8","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ejor.2011.04.026","volume":"216","author":"I.M. Bomze","year":"2012","unstructured":"Bomze I.M.: Copositive optimization\u2014recent developments and applications. Eur. J. Oper. Res. 216, 509\u2013520 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"543_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization (supp. Vol. A)","author":"I.M. Bomze","year":"1999","unstructured":"Bomze I.M., Budinich M., Pardalos P., Pelillo M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization (supp. Vol. A), pp. 1\u201374. Kluwer, Dordrecht (1999)"},{"key":"543_CR10","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1023\/A:1008369322970","volume":"13","author":"I.M. Bomze","year":"1998","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. 13, 369\u2013387 (1998)","journal-title":"J. Glob. Optim."},{"key":"543_CR11","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/B:COAP.0000026886.61324.e4","volume":"28","author":"I.M. Bomze","year":"2004","unstructured":"Bomze I.M., Locatelli M.: Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches. Comput. Optim. Appl. 28, 227\u2013245 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"543_CR12","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":"543_CR13","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10898-011-9749-3","volume":"52","author":"I.M. Bomze","year":"2012","unstructured":"Bomze I.M., Schachinger W., Uchida G.: Think co(mpletely )positive! Matrix properties, examples and a clustered bibliography on copositive optimization. J. Glob. Optim. 52, 423\u2013445 (2012)","journal-title":"J. Glob. Optim."},{"key":"543_CR14","doi-asserted-by":"crossref","first-page":"1511","DOI":"10.1016\/j.laa.2007.09.035","volume":"428","author":"S. Bundfuss","year":"2008","unstructured":"Bundfuss S., D\u00fcr M.: Algorithmic copositivity detection by simplicial partition. Linear Algebra Appl. 428, 1511\u20131523 (2008)","journal-title":"Linear Algebra Appl."},{"key":"543_CR15","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."},{"key":"543_CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/978-1-4614-0769-0_8","volume-title":"Handbook of Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications","author":"S. Burer","year":"2012","unstructured":"Burer S.: Copositive programming. In: Anjos, M.F., Lasserre, J.-B. (eds.) Handbook of Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications, pp. 201\u2013218. Springer, New York (2012)"},{"key":"543_CR17","unstructured":"Danninger, G.: A recursive algorithm for determining (strict) copositivity of a symmetric matrix. In: Rieder, U., et\u00a0al. (eds.) Methods OR, vol. 62. Hain, Meisenheim, pp. 45\u201352 (1990)"},{"key":"543_CR18","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/BF01585185","volume":"62","author":"G. Danninger","year":"1993","unstructured":"Danninger G., Bomze I.M.: Using copositivity for global optimality criteria in concave quadratic programming problems. Math. Program. 62, 575\u2013580 (1993)","journal-title":"Math. Program."},{"key":"543_CR19","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, 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"key":"543_CR20","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1017\/S0305004100036185","volume":"58","author":"P.H. Diananda","year":"1962","unstructured":"Diananda P.H.: On non-negative forms in real variables some or all of which are non-negative. Proc. Camb. Phil. Soc. 58, 17\u201325 (1962)","journal-title":"Proc. Camb. Phil. Soc."},{"key":"543_CR21","unstructured":"DIMACS: Second DIMACS Challenge. Test instances available at http:\/\/dimacs.rutgers.edu\/challenges . Last accessed Jan 13. (2010)"},{"key":"543_CR22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-642-12598-0_1","volume-title":"Recent Advances in Optimization and its Applications in Engineering","author":"M. D\u00fcr","year":"2010","unstructured":"D\u00fcr M.: Copositive programming\u2014a survey. In: Diehl, M., Glineur, F., Jarlebring, E., Michiels, W. (eds.) Recent Advances in Optimization and its Applications in Engineering, pp. 3\u201320. Springer, New York (2010)"},{"key":"543_CR23","first-page":"767","volume":"15","author":"G. Eichfelder","year":"2008","unstructured":"Eichfelder G., Jahn J.: Set-semidefinite optimization. J. Convex Anal. 15, 767\u2013801 (2008)","journal-title":"J. Convex Anal."},{"key":"543_CR24","first-page":"259","volume-title":"Nonlinear Analysis and Variational Problems","author":"G. Eichfelder","year":"2009","unstructured":"Eichfelder G., Jahn J.: Foundations of set-semidefinite optimization. In: Pardalos, P., Rassias, T.M., Khan, A.A (eds.) Nonlinear Analysis and Variational Problems, pp. 259\u2013284. Springer, New York (2009)"},{"key":"543_CR25","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1017\/S0305004100036951","volume":"59","author":"M. Jr. Hall","year":"1963","unstructured":"Hall M. Jr., Newman M.: Copositive and completely positive quadratic forms. Proc. Camb. Phil. Soc. 59, 329\u2013339 (1963)","journal-title":"Proc. Camb. Phil. Soc."},{"key":"543_CR26","volume-title":"Combinatorial Theory","author":"M. Jr. Hall","year":"1967","unstructured":"Hall M. Jr.: Combinatorial Theory. Blaisdell, Waltham (1967)"},{"key":"543_CR27","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0024-3795(69)90011-1","volume":"2","author":"E. Haynsworth","year":"1969","unstructured":"Haynsworth E., Hoffman A.J.: Two remarks on copositive matrices. Linear Algebra Appl. 2, 387\u2013392 (1969)","journal-title":"Linear Algebra Appl."},{"key":"543_CR28","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.laa.2005.06.019","volume":"408","author":"L. Hogben","year":"2005","unstructured":"Hogben L., Johnson C.R., Reams R.: The copositive completion problem. Linear Algebra Appl. 408, 207\u2013211 (2005)","journal-title":"Linear Algebra Appl."},{"key":"543_CR29","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0097-3165(73)90006-X","volume":"14","author":"A.J. Hoffman","year":"1973","unstructured":"Hoffman A.J., Pereira F.: On copositive matrices with \u22121, 0, 1 entries. J. Comb. Theory (A) 14, 302\u2013309 (1973)","journal-title":"J. Comb. Theory (A)"},{"key":"543_CR30","volume-title":"Introduction to Global Optimization","author":"R. Horst","year":"1995","unstructured":"Horst R., Pardalos P., Thoai N.: Introduction to Global Optimization. Kluwer, Dordrecht (1995)"},{"key":"543_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization\u2014Deterministic Approaches","author":"R. Horst","year":"1996","unstructured":"Horst R., Tuy H.: Global Optimization\u2014Deterministic Approaches, 3rd edn. Springer, Berlin (1996)","edition":"3"},{"key":"543_CR32","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1090\/S0025-5718-97-00809-0","volume":"218","author":"R. Horst","year":"1997","unstructured":"Horst R.: On generalized bisection of n-simplices. Math. Comput. 218, 691\u2013698 (1997)","journal-title":"Math. Comput."},{"key":"543_CR33","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0024-3795(01)00351-2","volume":"337","author":"W. Kaplan","year":"2001","unstructured":"Kaplan W.: A copositivity probe. Linear Algebra Appl. 337, 237\u2013251 (2001)","journal-title":"Linear Algebra Appl."},{"key":"543_CR34","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1023\/A:1004604732705","volume":"107","author":"M. Locatelli","year":"2000","unstructured":"Locatelli M., Raber U.: On the convergence of the simplicial branch-and-bound algorithm based on \u03c9-subdivisions. J. Optim. Theor. Appl. 107, 69\u201379 (2000)","journal-title":"J. Optim. Theor. Appl."},{"key":"543_CR35","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1023\/A:1004656716776","volume":"107","author":"M. Locatelli","year":"2000","unstructured":"Locatelli M., Raber U.: A finiteness result for the simplicial branch-and bound algorithm based on \u03c9-subdivisions. J. Optim. Theor. Appl. 107, 81\u201388 (2000)","journal-title":"J. Optim. Theor. Appl."},{"key":"543_CR36","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"K.G. Murty","year":"1987","unstructured":"Murty K.G., Kabadi S.N.: Some NP-complete problems in quadratic and linear programming. Math. Program. 39, 117\u2013129 (1987)","journal-title":"Math. Program."},{"key":"543_CR37","doi-asserted-by":"crossref","first-page":"4624","DOI":"10.1109\/CDC.2001.914655","volume":"5","author":"P.A. Parrilo","year":"2000","unstructured":"Parrilo P.A.: Semidefinite programming based test for matrix copositivity. Proc. 39th IEEE Conf. Decis. Control 5, 4624\u20134629 (2000)","journal-title":"Proc. 39th IEEE Conf. Decis. Control"},{"key":"543_CR38","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\u2013209 (1998)","journal-title":"Optim. Methods Softw."},{"key":"543_CR39","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF00938217","volume":"52","author":"H. Tuy","year":"1987","unstructured":"Tuy H.: Convex programs with an additional reverse convex constraint. J. Optim. Theor. Appl. 52, 463\u2013486 (1987)","journal-title":"J. Optim. Theor. Appl."},{"key":"543_CR40","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0024-3795(86)90246-6","volume":"81","author":"H. V\u00e4liaho","year":"1986","unstructured":"V\u00e4liaho H.: Criteria for copositive matrices. Linear Algebra Appl 81, 19\u201334 (1986)","journal-title":"Linear Algebra Appl"},{"key":"543_CR41","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0024-3795(89)90076-1","volume":"119","author":"H. V\u00e4liaho","year":"1989","unstructured":"V\u00e4liaho H.: Quadratic-programming criteria for copositive matrices. Linear Algebra Appl. 119, 163\u2013182 (1989)","journal-title":"Linear Algebra Appl."},{"key":"543_CR42","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/j.laa.2008.07.028","volume":"430","author":"S. Yang","year":"2009","unstructured":"Yang S., Li X.: Algorithms for determining the copositivity of a given symmetric matrix. Linear Algebra Appl. 430, 609\u2013618 (2009)","journal-title":"Linear Algebra Appl."},{"key":"543_CR43","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1080\/10556788.2010.544310","volume":"26","author":"J. \u017dilinskas","year":"2011","unstructured":"\u017dilinskas J., D\u00fcr M.: Depth-first simplicial partition for copositivity detection, with an application to Maxclique. Optim. Methods. Softw. 26, 499\u2013510 (2011)","journal-title":"Optim. Methods. Softw."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0543-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0543-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0543-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T22:41:44Z","timestamp":1561761704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0543-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,20]]},"references-count":43,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["543"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0543-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,20]]}}}