{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T22:36:47Z","timestamp":1782945407142,"version":"3.54.5"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1023\/a:1026583532263","type":"journal-article","created":{"date-parts":[[2003,11,6]],"date-time":"2003-11-06T17:11:16Z","timestamp":1068138676000},"page":"301-320","source":"Crossref","is-referenced-by-count":155,"title":["On Copositive Programming and Standard Quadratic Optimization Problems"],"prefix":"10.1007","volume":"18","author":[{"given":"Immanuel M.","family":"Bomze","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mirjam","family":"D\u00fcr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Etienne","family":"de Klerk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cornelis","family":"Roos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arie J.","family":"Quist","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tam\u00e1s","family":"Terlaky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"281693_CR1","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1090\/S0002-9904-1967-11751-8","volume":"73","author":"L.E. Baum","year":"1967","unstructured":"Baum, L.E. and Eagon, J.A. (1967), An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bull. Amer. Math. Soc. 73: 360-363.","journal-title":"Bull. Amer. Math. Soc."},{"key":"281693_CR2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.2140\/pjm.1968.27.211","volume":"27","author":"L.E. Baum","year":"1968","unstructured":"Baum, L.E. and Sell, G.R. (1968), Growth transformations for functions on manifolds. Pacif. J. Math. 27: 211-227.","journal-title":"Pacif. J. Math."},{"key":"281693_CR3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0024-3795(88)90237-6","volume":"107","author":"A. Berman","year":"1988","unstructured":"Berman, A. (1988), Complete positivity. Linear Algebra Appl. 107: 57-63.","journal-title":"Linear Algebra Appl."},{"key":"281693_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0024-3795(87)90029-2","volume":"95","author":"A. Berman","year":"1987","unstructured":"Berman, A. and Hershkowitz, D. (1987), Combinatorial results on completely positive matrices. Linear Algebra Appl. 95: 111-125.","journal-title":"Linear Algebra Appl."},{"key":"281693_CR5","first-page":"243","volume":"8","author":"I.M. Bomze","year":"1987","unstructured":"Bomze, I.M. (1987), Remarks on the recursive structure of copositivity. J.Inf.Optimiz.Sci. 8: 243-260.","journal-title":"J.Inf.Optimiz.Sci."},{"key":"281693_CR6","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. (1996), Block pivoting and shortcut strategies for detecting copositivity. Linear Algebra Appl. 248: 161-184.","journal-title":"Linear Algebra Appl."},{"key":"281693_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1008230200610","volume":"10","author":"I.M. Bomze","year":"1997","unstructured":"Bomze, I.M. (1997), Evolution towards the maximum clique. J. Global Optimiz. 10: 143-164.","journal-title":"J. Global Optimiz."},{"key":"281693_CR8","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1023\/A:1008297330705","volume":"11","author":"I.M. Bomze","year":"1997","unstructured":"Bomze, I.M. (1997), Global escape strategies for maximizing quadratic forms over a simplex. J. Global Optimiz. 11: 325-338.","journal-title":"J. Global Optimiz."},{"key":"281693_CR9","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1023\/A:1008369322970","volume":"13","author":"I.M. Bomze","year":"1998","unstructured":"Bomze, I.M. (1998), On standard quadratic optimization problems. J. Global Optimiz. 13: 369-387.","journal-title":"J. Global Optimiz."},{"key":"281693_CR10","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1137\/S0895479898341487","volume":"21","author":"I.M. Bomze","year":"2000","unstructured":"Bomze, I.M. (2000), Linear-time detection of copositivity for tridiagonal matrices and extension to block-tridiagonality. SIAM J. Matrix Anal. Appl.. 21: 840-848.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"281693_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-1-4757-2600-8_6","volume-title":"Developments in Global Optimization","author":"I.M. Bomze","year":"1997","unstructured":"Bomze, I.M., Pelillo, M. and Giacomini, R. (1997), Evolutionary approach to the maximum clique problem: empirical evidence on a larger scale. In: Bomze, I.M., Csendes, T., Horst, R. and Pardalos, P.M. (eds.), Developments in Global Optimization, Kluwer, Dordrecht, pp. 95-108."},{"key":"281693_CR12","first-page":"279","volume":"89","author":"I.M. Bomze","year":"1999","unstructured":"Bomze, I.M. and Stix, V. (1999), Genetical engineering via negative fitness: evolutionary dynamics for global optimization. Annals of O.R. 89: 279-318.","journal-title":"Annals of O.R."},{"key":"281693_CR13","volume-title":"An Introduction to Population Genetics Theory","author":"J.F. Crow","year":"1970","unstructured":"Crow, J.F., Kimura, M. (1970), An Introduction to Population Genetics Theory, Harper & Row, New York."},{"key":"281693_CR14","first-page":"45","volume-title":"Methods of Operations Research","author":"G. Danninger","year":"1990","unstructured":"Danninger, G. (1990), A recursive algorithm to detect (strict) copositivity of a symmetric matrix. In: Rieder, U., Gessner, P., Peyerimhoff, A. and Radermacher, F.J., (eds.), Methods of Operations Research 62: 45-52. Hain, Meisenheim."},{"key":"281693_CR15","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1080\/03081089408818334","volume":"37","author":"J.H. Drew","year":"1994","unstructured":"Drew, J.H., Johnson, C.R. and Loewy, R. (1994), Completely positive matrices associated with M-matrices. Linear and Multilinear Algebra 37: 303-310.","journal-title":"Linear and Multilinear Algebra"},{"key":"281693_CR16","first-page":"235","volume":"79","author":"K. Fujisawa","year":"1997","unstructured":"Fujisawa, K., Kojima, M. and Nakata, K. (1997), Exploiting sparsity in primal-dual interiorpoint methods for semidefinite programming. Math. Prog. 79: 235-253.","journal-title":"Math. Prog."},{"key":"281693_CR17","series-title":"Research Report","volume-title":"Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework","author":"M. Fukuda","year":"1999","unstructured":"Fukuda, M., Kojima, M., Murota, K. and Nakata, K. (1999), Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework, Research Report B-358, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo 152-8552, Japan."},{"key":"281693_CR18","first-page":"143","volume":"79","author":"M.X. Goemans","year":"1997","unstructured":"Goemans, M.X. (1997), Semidefinite programming in combinatorial optimization. Math. Prog. 79: 143-161.","journal-title":"Math. Prog."},{"key":"281693_CR19","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0024-3795(83)90095-2","volume":"49","author":"K.P. Hadeler","year":"1983","unstructured":"Hadeler, K.P. (1983), On copositive matrices. Linear Algebra Appl. 49: 79-89.","journal-title":"Linear Algebra Appl."},{"key":"281693_CR20","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1017\/S0305004100036951","volume":"59","author":"M. Hall Jr.","year":"1963","unstructured":"Hall, M., Jr. and M. Newman, (1963), Copositive and completely positive quadratic forms. Proc. Cambridge Philos. Soc. 59: 329-339.","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"281693_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0024-3795(83)90162-3","volume":"55","author":"J. Hannah","year":"1983","unstructured":"Hannah, J. and Laffey, T.J. (1983), Nonnegative factorization of completely positive matrices. Linear Algebra Appl. 55: 1-9.","journal-title":"Linear Algebra Appl."},{"key":"281693_CR22","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C. Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, R.J. and Wolkowicz, H. (1996), An interior-point method for semidefinite programming. SIAM J. Optimiz. 6: 342-361.","journal-title":"SIAM J. Optimiz."},{"key":"281693_CR23","volume-title":"The Theory of Evolution and Dynamical Systems","author":"J. Hofbauer","year":"1988","unstructured":"Hofbauer, J. and Sigmund, K. (1988), The Theory of Evolution and Dynamical Systems. Cambridge University Press, Cambridge, UK."},{"key":"281693_CR24","volume-title":"Introduction to Global Optimization","author":"R. Horst","year":"1995","unstructured":"Horst, R., Pardalos, P.M. and Thoai, N.V. (1995), Introduction to Global Optimization, Kluwer, Dordrecht."},{"key":"281693_CR25","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TPAMI.1983.4767390","volume":"5","author":"R.A. Hummel","year":"1983","unstructured":"Hummel, R.A. and Zucker, S.W. (1983), On the foundations of relaxation labeling processes. IEEE Trans. Pattern Anal. Machine Intell. 5: 267-287.","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"281693_CR26","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1111\/j.1467-9574.1996.tb01485.x","volume":"50","author":"B. Jansen","year":"1995","unstructured":"Jansen, B., Roos, C. and Terlaky, T. (1995), Interior point methods: a decade after Karmarkar. A survey, with application to the smallest eigenvalue problem. Statistica Neerlandica 50: 146-170.","journal-title":"Statistica Neerlandica"},{"key":"281693_CR27","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0024-3795(87)90334-X","volume":"96","author":"M. Kaykobad","year":"1987","unstructured":"Kaykobad, M. (1987), On nonnegative factorization matrices. Linear Algebra Appl. 96: 27-33.","journal-title":"Linear Algebra Appl."},{"key":"281693_CR28","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1009791827917","volume":"2","author":"E. d. Klerk","year":"1998","unstructured":"Klerk, E. de, Roos, C. and Terlaky, T. (1998), Polynomial primal-dual affine scaling algorithms in semidefinite programming. J. Combin. Optimiz. 2: 51-69.","journal-title":"J. Combin. Optimiz."},{"key":"281693_CR29","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/S1052623494269035","volume":"7","author":"M. Kojima","year":"1997","unstructured":"Kojima, M., Shindoh, S. and Hara, S. (1997), Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optimiz. 7: 86-125.","journal-title":"SIAM J. Optimiz."},{"key":"281693_CR30","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1080\/10556789808805715","volume":"10","author":"M. Kojima","year":"1998","unstructured":"Kojima, M. and Tun\u00e7el, L. (1998), Monotonicity of primal-dual interior-point algorithms for semidefinite programming problems. Optimiz. Methods Softw. 10: 275-296.","journal-title":"Optimiz. Methods Softw."},{"key":"281693_CR31","first-page":"15","volume":"28","author":"C.M. Lau","year":"1978","unstructured":"Lau, C.M. and Markham, T.L., (1978), Square triangular factorizations of completely positive matrices. J. Ind. Math. Soc. 28: 15-24.","journal-title":"J. Ind. Math. Soc."},{"key":"281693_CR32","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1002\/j.1538-7305.1983.tb03114.x","volume":"62","author":"S.E. Levinson","year":"1983","unstructured":"Levinson, S.E., Rabiner, L.R. and Sondhi, M.M. (1983), An introduction to the application of the theory of probabilistic functions of a Markov process to automatic speech recognition. Bell Syst. Tech. J. 62: 1035-1074.","journal-title":"Bell Syst. Tech. J."},{"key":"281693_CR33","first-page":"66","volume":"16","author":"Y. Lyubich","year":"1980","unstructured":"Lyubich, Y., Maistrowskii, G. D. and Ol'khovskii, Yu.G. (1980), Selection-induced convergence to equilibrium in a single-locus autosomal population. Problems of Information Transmission 16: 66-75.","journal-title":"Problems of Information Transmission"},{"key":"281693_CR34","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1017\/S0305004100046405","volume":"69","author":"T. L. Markham","year":"1971","unstructured":"Markham, T. L. (1971), Factorizations of completely positive matrices. Proc. Cambridge Philos. Soc. 69: 53-58.","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"281693_CR35","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0024-3795(81)90276-7","volume":"35","author":"D.H. Martin","year":"1981","unstructured":"Martin, D.H. and Jacobson, D.H. (1981), Copositive matrices and definiteness of quadratic forms subject to homogeneous linear inequality constraints, Linear Algebra Appl. 35: 227-258.","journal-title":"Linear Algebra Appl."},{"key":"281693_CR36","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1137\/S1052623495293056","volume":"7","author":"R.D.C. Monteiro","year":"1997","unstructured":"Monteiro, R.D.C. (1997), Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optimiz. 7: 663-678.","journal-title":"SIAM J. Optimiz."},{"key":"281693_CR37","series-title":"Technical Report SOR","volume-title":"Primal-dual affine-scaling algorithm fails for semidefinite programming","author":"M. Muramatsu","year":"1997","unstructured":"Muramatsu, M. and Vanderbei, R.J. (1997), Primal-dual affine-scaling algorithm fails for semidefinite programming. Technical Report SOR 97-04, Princeton University, NJ 08544."},{"key":"281693_CR38","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"K.G. Murty","year":"1987","unstructured":"Murty, K.G. and Kabadi, S.N. (1987), Some NP-complete problems in quadratic and linear programming. Math. Prog. 39: 117-129.","journal-title":"Math. Prog."},{"key":"281693_CR39","volume-title":"Interior point methods in convex programming: theory and applications","author":"Y.E. Nesterov","year":"1994","unstructured":"Nesterov, Y.E. and Nemirovskii, A.S. (1994), Interior point methods in convex programming: theory and applications. SIAM, Philadelphia, PA."},{"key":"281693_CR40","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/A:1008315627883","volume":"14","author":"I. Nowak","year":"1999","unstructured":"Nowak, I. (1999), A new semidefinite programming bound for indefinite quadratic forms over a simplex. J. Global Optimiz. 14: 357-364.","journal-title":"J. Global Optimiz."},{"key":"281693_CR41","doi-asserted-by":"crossref","unstructured":"Pelillo, M. (1994), On the dynamics of relaxation labeling processes. Proc. IEEE Int. Conf. Neural Networks, Orlando, FL, pp. 1006-1011.","DOI":"10.1109\/ICNN.1994.374320"},{"key":"281693_CR42","first-page":"313","volume":"2","author":"M. Pelillo","year":"1995","unstructured":"Pelillo, M. (1995), Relaxation labeling networks for the maximum clique problem. J. Artif. Neural Networks 2: 313-327.","journal-title":"J. Artif. Neural Networks"},{"key":"281693_CR43","unstructured":"Raber, U. (1999), Nonconvex all-quadratic global optimization problems: solution methods, application and related topics. Ph.D. dissertation, University of Trier."},{"key":"281693_CR44","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1109\/TSMC.1976.4309519","volume":"6","author":"A. Rosenfeld","year":"1976","unstructured":"Rosenfeld, A., Hummel, R.A. and Zucker, S.W. (1976), Scene labeling by relaxation operations. IEEE Trans. Syst. Man Cybern. 6: 420-433.","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"281693_CR45","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. and Terlaky, T. (1998), Copositive relaxation for general quadratic programming. Optimiz. Methods Softw. 9: 185-209.","journal-title":"Optimiz. Methods Softw."},{"key":"281693_CR46","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0040-5809(87)90043-8","volume":"32","author":"K. Sigmund","year":"1987","unstructured":"Sigmund, K. (1987), Game dynamics, mixed strategies, and gradient systems. Theor. Pop. Biol. 32: 114-126.","journal-title":"Theor. Pop. Biol."},{"key":"281693_CR47","unstructured":"Tun\u00e7el, L. (1999), Generalization of primal-dual interior-point methods to convex optimization problems in conic form. Technical Report CORR 99-35, University of Waterloo."},{"key":"281693_CR48","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. (1986), Criteria for copositive matrices. Linear Algebra Appl. 81: 19-34.","journal-title":"Linear Algebra Appl."},{"key":"281693_CR49","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0024-3795(88)90148-6","volume":"101","author":"H. V\u00e4liaho","year":"1988","unstructured":"V\u00e4liaho, H. (1988), Testing the definiteness of matrices on polyhedral cones. Linear Algebra Appl. 101: 135-165.","journal-title":"Linear Algebra Appl."},{"key":"281693_CR50","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. (1989), Quadratic-programming criteria for copositive matrices. Linear Algebra Appl. 119: 163-182.","journal-title":"Linear Algebra Appl."},{"key":"281693_CR51","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0024-3795(97)00278-4","volume":"271","author":"S.H. Xiang","year":"1998","unstructured":"Xiang, S.H. and Xiang, S.W. (1998), Notes on completely positive matrices. Linear Algebra Appl. 271: 273-282.","journal-title":"Linear Algebra Appl."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026583532263.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026583532263\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026583532263.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:48:28Z","timestamp":1751366908000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026583532263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["281693"],"URL":"https:\/\/doi.org\/10.1023\/a:1026583532263","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}