{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T15:59:50Z","timestamp":1774281590233,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,9,12]],"date-time":"2013-09-12T00:00:00Z","timestamp":1378944000000},"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":[[2014,3]]},"DOI":"10.1007\/s10589-013-9594-z","type":"journal-article","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T15:41:24Z","timestamp":1378914084000},"page":"403-415","source":"Crossref","is-referenced-by-count":93,"title":["On the computational complexity of membership problems for the completely positive cone and its dual"],"prefix":"10.1007","volume":"57","author":[{"given":"Peter J. C.","family":"Dickinson","sequence":"first","affiliation":[]},{"given":"Luuk","family":"Gijben","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,12]]},"reference":[{"key":"9594_CR1","doi-asserted-by":"crossref","DOI":"10.1142\/5273","volume-title":"Completely Positive Matrices","author":"A. Berman","year":"2003","unstructured":"Berman, A., Shaked-Monderer, N.: Completely Positive Matrices. World Scientific, Singapore (2003)"},{"key":"9594_CR2","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 programming\u2014recent developments and applications. Cent. Eur. J. Oper. Res. 216, 509\u2013520 (2012)","journal-title":"Cent. Eur. J. Oper. Res."},{"issue":"1","key":"9594_CR3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s12532-011-0022-z","volume":"3","author":"I.M. Bomze","year":"2011","unstructured":"Bomze, I.M., Jarre, F., Rendl, F.: Quadratic factorization heuristics for copositive programming. Math. Program. Comput. 3(1), 37\u201357 (2011)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"9594_CR4","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(3), 423\u2013445 (2012)","journal-title":"J. Glob. Optim."},{"key":"9594_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J. Bondy","year":"1976","unstructured":"Bondy, J., Murty, U.: Graph Theory with Applications. Macmillan, London (1976)"},{"issue":"1","key":"9594_CR6","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/070711815","volume":"20","author":"S. Bundfuss","year":"2009","unstructured":"Bundfuss, S., D\u00fcr, M.: An adaptive linear approximation algorithm for copositive programs. SIAM J. Optim. 20(1), 30\u201353 (2009)","journal-title":"SIAM J. Optim."},{"key":"9594_CR7","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: Handbook of Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications, pp. 201\u2013218. Springer, New York (2012)"},{"issue":"2","key":"9594_CR8","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":"2","key":"9594_CR9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10100-007-0052-9","volume":"16","author":"E. Klerk de","year":"2008","unstructured":"de Klerk, E.: The complexity of optimizing over a simplex, hypercube or sphere: a short survey. Cent. Eur. J. Oper. Res. 16(2), 111\u2013125 (2008)","journal-title":"Cent. Eur. J. Oper. Res."},{"issue":"4","key":"9594_CR10","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.: Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12(4), 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"key":"9594_CR11","unstructured":"Dickinson, P.J.C.: The copositive cone, the completely positive cone and their generalisations. Ph.D. thesis, University of Groningen (2013)"},{"issue":"3","key":"9594_CR12","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1137\/110848177","volume":"33","author":"P.J.C. Dickinson","year":"2012","unstructured":"Dickinson, P.J.C., D\u00fcr, M.: Linear-time complete positivity detection and decomposition of sparse matrices. SIAM J. Matrix Anal. Appl. 33(3), 701\u2013720 (2012)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9594_CR13","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, Berlin (2010)"},{"key":"9594_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9594_CR15","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)"},{"issue":"2","key":"9594_CR16","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1137\/050648237","volume":"19","author":"N. Gvozdenovi\u0107","year":"2008","unstructured":"Gvozdenovi\u0107, N., Laurent, M.: The operator \u03a8 for the chromatic number of a graph. SIAM J. Optim. 19(2), 572\u2013591 (2008)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9594_CR17","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1137\/090750391","volume":"52","author":"J.B. Hiriart-Urruty","year":"2010","unstructured":"Hiriart-Urruty, J.B., Seeger, A.: A variational approach to copositive matrices. SIAM Rev. 52(4), 593\u2013629 (2010)","journal-title":"SIAM Rev."},{"issue":"2","key":"9594_CR18","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10898-008-9374-y","volume":"45","author":"F. Jarre","year":"2009","unstructured":"Jarre, F., Schmallowsky, K.: On the computation of certificates. J. Glob. Optim. 45(2), 281\u2013296 (2009)","journal-title":"J. Glob. Optim."},{"key":"9594_CR19","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.: On nonnegative factorization of matrices. Linear Algebra Appl. 96, 27\u201333 (1987)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"9594_CR20","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"K. Murty","year":"1987","unstructured":"Murty, K., Kabadi, S.: Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39(2), 117\u2013129 (1987)","journal-title":"Math. Program."},{"key":"9594_CR21","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24. Springer, Berlin (2003)"},{"issue":"2","key":"9594_CR22","first-page":"357","volume":"12","author":"D. Yudin","year":"1976","unstructured":"Yudin, D., Nemirovskii, A.: Informational complexity and efficient methods for the solution of convex extremal problems. \u00c8kon. Mat. Metody 12(2), 357\u2013369 (1976). English translation: Matekon 13(3) (1977) 25\u201345","journal-title":"\u00c8kon. Mat. Metody"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9594-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-013-9594-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9594-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:37:35Z","timestamp":1559241455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-013-9594-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,12]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["9594"],"URL":"https:\/\/doi.org\/10.1007\/s10589-013-9594-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,12]]}}}