{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T09:12:07Z","timestamp":1719738727794},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T00:00:00Z","timestamp":1515024000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"KAKEN","award":["(B)23310099"]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10479-017-2720-z","type":"journal-article","created":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T17:48:13Z","timestamp":1515088093000},"page":"155-182","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["LP-based tractable subcones of the semidefinite plus nonnegative cone"],"prefix":"10.1007","volume":"265","author":[{"given":"Akihiro","family":"Tanaka","sequence":"first","affiliation":[]},{"given":"Akiko","family":"Yoshise","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,4]]},"reference":[{"key":"2720_CR1","unstructured":"Ahmadi, A. A., Dash, S., & Hall, G. (2015). Optimization over structured subsets of positive semidefinite matrices via column generation. arXiv:1512.05402 [math.OC]."},{"key":"2720_CR2","first-page":"297","volume-title":"An Introduction to formally real Jordan algebras and their applications in optimization, Handbook on Semidefinite, Conic and Polynomial Optimization","author":"F Alizadeh","year":"2012","unstructured":"Alizadeh, F. (2012). An Introduction to formally real Jordan algebras and their applications in optimization, Handbook on Semidefinite, Conic and Polynomial Optimization (pp. 297\u2013337). New York: Springer."},{"key":"2720_CR3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.2140\/pjm.1975.57.15","volume":"57","author":"GP Barker","year":"1975","unstructured":"Barker, G. P., & Carlson, D. (1975). Cones of diagonally dominant matrices. Pacific Journal of Mathematics, 57, 15\u201332.","journal-title":"Pacific Journal of Mathematics"},{"key":"2720_CR4","doi-asserted-by":"crossref","unstructured":"Berman,\u00a0A. (1973). Cones, matrices and mathematical programming. Lecture notes in economics and mathematical systems (Vol. 79). Springer.","DOI":"10.1007\/978-3-642-80730-5_2"},{"key":"2720_CR5","doi-asserted-by":"crossref","DOI":"10.1142\/5273","volume-title":"Completely positive matrices","author":"A Berman","year":"2003","unstructured":"Berman, A., & Monderer, N. S. (2003). Completely positive matrices. Singapore: World Scientific Publishing."},{"issue":"15","key":"2720_CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0024-3795(95)00165-4","volume":"248","author":"IM Bomze","year":"1996","unstructured":"Bomze, I. M. (1996). Block pivoting and shortcut strategies for detecting copositivity. Linear Algebra and its Applications, 248(15), 161\u2013184.","journal-title":"Linear Algebra and its Applications"},{"issue":"3","key":"2720_CR7","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ejor.2011.04.026","volume":"216","author":"IM Bomze","year":"2012","unstructured":"Bomze, I. M. (2012). Copositive optimization\u2014Recent developments and applications. European Journal of Operational Research, 216(3), 509\u2013520.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2720_CR8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"IM Bomze","year":"2002","unstructured":"Bomze, I. M., & De Klerk, E. (2002). Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. Journal of Global Optimization, 24(2), 163\u2013185.","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"2720_CR9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"IM Bomze","year":"2000","unstructured":"Bomze, I. M., D\u00fcr, M., De Klerk, E., Roos, C., Quist, A. J., & Terlaky, T. (2000). On copositive programming and standard quadratic optimization problems. Journal of Global Optimization, 18(4), 301\u2013320.","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"2720_CR10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-012-0543-x","volume":"138","author":"IM Bomze","year":"2013","unstructured":"Bomze, I. M., & Eichfelder, G. (2013). Copositivity detection by difference-of-convex decomposition and $$\\omega $$\u03c9-subdivision. Mathematical Programming, Series A, 138(1), 365\u2013400.","journal-title":"Mathematical Programming, Series A"},{"key":"2720_CR11","first-page":"1","volume":"63","author":"C Br\u00e1s","year":"2015","unstructured":"Br\u00e1s, C., Eichfelder, G., & J\u00fadice, J. (2015). Copositivity tests based on the linear complementarity problem. Computational Optimization and Applications, 63, 1\u201333.","journal-title":"Computational Optimization and Applications"},{"key":"2720_CR12","unstructured":"Bundfuss,\u00a0S. (2009). Copositive matrices, copositive programming, and applications. Ph.D. Dissertation, TU Darmstadt. http:\/\/www3.mathematik.tu-darmstadt.de\/index.php?id=483. Confirmed March 20, 2017."},{"issue":"7","key":"2720_CR13","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. (2008). Algorithmic copositivity detection by simplicial partition. Linear Algebra and its Applications, 428(7), 1511\u20131523.","journal-title":"Linear Algebra and its Applications"},{"issue":"4","key":"2720_CR14","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S. (2009). On the copositive representation of binary and continuous nonconvex quadratic programs. Mathematical Programming, 120(4), 479\u2013495.","journal-title":"Mathematical Programming"},{"key":"2720_CR15","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. (2002). Approximation of the stability number of a graph via copositive programming. SIAM Journal on Optimization, 12, 875\u2013892.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"2720_CR16","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.ejor.2013.02.031","volume":"229","author":"Z Deng","year":"2013","unstructured":"Deng, Z., Fang, S.-C., Jin, Q., & Xing, W. (2013). Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme. European Journal of Operations research, 229(1), 21\u201328.","journal-title":"European Journal of Operations research"},{"issue":"1","key":"2720_CR17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1017\/S0305004100036185","volume":"58","author":"PH Diananda","year":"1962","unstructured":"Diananda, P. H. (1962). On non-negative forms in real variables some or all of which are non-negative. Mathematical Proceedings of the Cambridge Philosophical Society, 58(1), 17\u201325.","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"2720_CR18","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.jmaa.2011.03.005","volume":"380","author":"PJC Dickinson","year":"2011","unstructured":"Dickinson, P. J. C. (2011). Geometry of the copositive and completely positive cones. Journal of Mathematical Analysis and Applications, 380, 377\u2013395.","journal-title":"Journal of Mathematical Analysis and Applications"},{"issue":"1","key":"2720_CR19","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10898-013-0040-7","volume":"58","author":"PJC Dickinson","year":"2014","unstructured":"Dickinson, P. J. C. (2014). On the exhaustivity of simplicial partitioning. Journal of Global Optimization, 58(1), 189\u2013203.","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"2720_CR20","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10589-013-9594-z","volume":"57","author":"PJC Dickinson","year":"2014","unstructured":"Dickinson, P. J. C., & Gijben, L. (2014). On the computational complexity of membership problems for the completely positive cone and its dual. Computational Optimization and Applications, 57(2), 403\u2013415.","journal-title":"Computational Optimization and Applications"},{"key":"2720_CR21","doi-asserted-by":"crossref","unstructured":"D\u00fcr,\u00a0M. (2010). Copositive programming\u2014A survey. In Recent advances in optimization and its applications in engineering (pp. 3\u201320). Berlin: Springer.","DOI":"10.1007\/978-3-642-12598-0_1"},{"issue":"1","key":"2720_CR22","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10107-012-0625-9","volume":"140","author":"M D\u00fcr","year":"2013","unstructured":"D\u00fcr, M., & Hiriart-Urruty, J.-B. (2013). Testing copositivity with the help of difference-of-convex optimization. Mathematical Programming, 140(1), 31\u201343.","journal-title":"Mathematical Programming"},{"key":"2720_CR23","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534778.001.0001","volume-title":"Analysis on symmetric cones","author":"J Faraut","year":"1994","unstructured":"Faraut, J., & Kor\u00e1nyi, A. (1994). Analysis on symmetric cones. Oxford: Oxford University Press."},{"key":"2720_CR24","volume-title":"Mimeographed notes","author":"W Fenchel","year":"1953","unstructured":"Fenchel, W. (1953). Convex cones, sets and functions. In D. W. Blackett (Ed.), Mimeographed notes. Princeton, NJ: Princeton University Press."},{"issue":"3","key":"2720_CR25","doi-asserted-by":"crossref","first-page":"382","DOI":"10.21136\/CMJ.1962.100526","volume":"12","author":"M Fiedler","year":"1962","unstructured":"Fiedler, M., & Pt\u00e1k, V. (1962). On matrices with non-positive off-diagonal elements and positive principal minors. Czechoslovak Mathematical Journal, 12(3), 382\u2013400.","journal-title":"Czechoslovak Mathematical Journal"},{"key":"2720_CR26","volume-title":"Matrix computations","author":"GH Golub","year":"1996","unstructured":"Golub, G. H., & Van Loan, C. F. (1996). Matrix computations (Third ed.). Baltimore: Johns Hopkins University Press.","edition":"Third"},{"issue":"218","key":"2720_CR27","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1090\/S0025-5718-97-00809-0","volume":"66","author":"R Horst","year":"1997","unstructured":"Horst, R. (1997). On generalized bisection of $$n$$n-simplices. Mathematics of Computation, 66(218), 691\u2013698.","journal-title":"Mathematics of Computation"},{"key":"2720_CR28","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix analysis","author":"RA Horn","year":"1985","unstructured":"Horn, R. A., & Johnson, C. R. (1985). Matrix analysis. Cambridge: Cambridge University Press."},{"issue":"2","key":"2720_CR29","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. (2009). On the computation of $${\\cal{C}}^*$$C\u2217 certificates. Journal of Global Optimization, 45(2), 281\u2013296.","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"2720_CR30","doi-asserted-by":"crossref","first-page":"9","DOI":"10.13001\/1081-3810.1245","volume":"17","author":"CR Johnson","year":"2008","unstructured":"Johnson, C. R., & Reams, R. (2008). Constructing copositive matrices from interior matrices. The Electronic Journal of Linear Algebra, 17(1), 9\u201320.","journal-title":"The Electronic Journal of Linear Algebra"},{"issue":"2","key":"2720_CR31","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"KG Murty","year":"1987","unstructured":"Murty, K. G., & Kabadi, S. N. (1987). Some NP-complete problems in quadratic and nonlinear programming. Mathematical Programming, 39(2), 117\u2013129.","journal-title":"Mathematical Programming"},{"key":"2720_CR32","unstructured":"Nowak,\u00a0I. (1998). A global optimality criterion for nonconvex quadratic programming over a simplex. Pre-Print 9817, Humboldt University, Berlin. http:\/\/wwwiam.mathematik.hu-berlin.de\/ivo\/ivopages\/work.html. Confirmed March 20, 2017."},{"issue":"1","key":"2720_CR33","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/050637467","volume":"18","author":"J Povh","year":"2007","unstructured":"Povh, J., & Rendl, F. (2007). A copositive programming approach to graph partitioning. SIAM Journal on Optimization, 18(1), 223\u2013241.","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"2720_CR34","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.disopt.2009.01.002","volume":"6","author":"J Povh","year":"2009","unstructured":"Povh, J., & Rendl, F. (2009). Copositive and semidefinite relaxations of the quadratic assignment problem. Discrete Optimization, 6(3), 231\u2013241.","journal-title":"Discrete Optimization"},{"key":"2720_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R. T., & Wets, R. J.-B. (1998). Variational analysis. Berlin: Springer."},{"issue":"3","key":"2720_CR36","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s10898-011-9766-2","volume":"52","author":"J Sponsel","year":"2012","unstructured":"Sponsel, J., Bundfuss, S., & D\u00fcr, M. (2012). An improved algorithm to test copositivity. Journal of Global Optimization, 52(3), 537\u2013551.","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"2720_CR37","first-page":"101","volume":"11","author":"A Tanaka","year":"2015","unstructured":"Tanaka, A., & Yoshise, A. (2015). An LP-based algorithm to test copositivity. Pacific Journal of Optimization, 11(1), 101\u2013120.","journal-title":"Pacific Journal of Optimization"},{"key":"2720_CR38","doi-asserted-by":"crossref","unstructured":"Yoshise,\u00a0A., & Matsukawa,\u00a0Y. (2010). On optimization over the doubly nonnegative cone. In Proceedings of 2010 IEEE multi-conference on systems and control (pp. 13\u201319).","DOI":"10.1109\/CACSD.2010.5612811"},{"issue":"3","key":"2720_CR39","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1080\/10556788.2010.544310","volume":"26","author":"J Z\u0306ilinskas","year":"2011","unstructured":"Z\u0306ilinskas, J., & D\u00fcr, M. (2011). Depth-first simplicial partition for copositivity detection, with an application to MaxClique. Optimization Methods and Software, 26(3), 499\u2013510.","journal-title":"Optimization Methods and Software"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2720-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2720-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2720-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T08:31:35Z","timestamp":1719736295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2720-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,4]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["2720"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2720-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,4]]}}}