{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T07:15:35Z","timestamp":1721027735141},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,10,27]],"date-time":"2012-10-27T00:00:00Z","timestamp":1351296000000},"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":[[2014,2]]},"DOI":"10.1007\/s10107-012-0601-4","type":"journal-article","created":{"date-parts":[[2012,10,25]],"date-time":"2012-10-25T20:48:26Z","timestamp":1351198106000},"page":"211-229","source":"Crossref","is-referenced-by-count":18,"title":["Factorization and cutting planes for completely positive matrices by copositive projection"],"prefix":"10.1007","volume":"143","author":[{"given":"Julia","family":"Sponsel","sequence":"first","affiliation":[]},{"given":"Mirjam","family":"D\u00fcr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,27]]},"reference":[{"issue":"4","key":"601_CR1","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/BF00935003","volume":"43","author":"M Arioli","year":"1984","unstructured":"Arioli, M., Laratta, A., Menchi, O.: Numerical computation of the projection of a point onto a polyhedron. J. Optim. Theory Appl. 43(4), 495\u2013525 (1984)","journal-title":"J. Optim. Theory Appl."},{"key":"601_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.laa.2006.04.001","volume":"419","author":"A Berman","year":"2006","unstructured":"Berman, A., Rothblum, U.: A note on the computation of the CP-rank. Linear Algebra Appl. 419, 1\u20137 (2006)","journal-title":"Linear Algebra Appl."},{"key":"601_CR3","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":"601_CR4","unstructured":"Bomze, I.: Building a completely positive factorization. Tech. rep., TR-ISDS, Department of Statistics and Decision Support Systems, University of Vienna, Austria (2009). Online at http:\/\/www.optimization-online.org\/DB_HTML\/2009\/08\/2381.html"},{"key":"601_CR5","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ejor.2011.04.026","volume":"216","author":"I Bomze","year":"2012","unstructured":"Bomze, I.: Copositive optimization \u2014 recent developments and applications. Eur. J. Oper. Res. 216, 509\u2013520 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"601_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s10107-010-0363-9","volume":"124","author":"I Bomze","year":"2010","unstructured":"Bomze, I., Frommlet, F., Locatelli, M.: Copositivity cuts for improving SDP bounds on the clique number. Math. Program. 124, 13\u201332 (2010)","journal-title":"Math. Program."},{"key":"601_CR7","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1080\/02331930903395634","volume":"59","author":"I Bomze","year":"2010","unstructured":"Bomze, I., Frommlet, F., Locatelli, M.: Gap, cosum, and product properties of the $$\\theta ^{\\prime }$$ bound on the clique number. Optimization 59, 1041\u20131051 (2010)","journal-title":"Optimization"},{"key":"601_CR8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"I Bomze","year":"2002","unstructured":"Bomze, I., de Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Glob. Optim. 24, 163\u2013185 (2002)","journal-title":"J. Glob. Optim."},{"key":"601_CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10107-007-0138-0","volume":"115","author":"I Bomze","year":"2008","unstructured":"Bomze, I., 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."},{"issue":"3","key":"601_CR10","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10898-011-9749-3","volume":"52","author":"I Bomze","year":"2012","unstructured":"Bomze, I., 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":"601_CR11","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, 30\u201353 (2009)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"601_CR12","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."},{"key":"601_CR13","doi-asserted-by":"crossref","first-page":"1539","DOI":"10.1016\/j.laa.2009.05.021","volume":"431","author":"S Burer","year":"2009","unstructured":"Burer, S., Anstreicher, K., D\u00fcr, M.: The difference between $$5\\times 5$$ doubly nonnegative and completely positive matrices. Linear Algebra Appl. 431, 1539\u20131552 (2009)","journal-title":"Linear Algebra Appl."},{"key":"601_CR14","doi-asserted-by":"crossref","unstructured":"Burer, S., Dong, H.: Separation and relaxation for cones of quadratic forms. Mathematical Programming, in print. Online at doi: 10.1007\/s10107-011-0495-6","DOI":"10.1007\/s10107-011-0495-6"},{"issue":"4","key":"601_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.: 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":"601_CR16","doi-asserted-by":"crossref","first-page":"723","DOI":"10.13001\/1081-3810.1404","volume":"20","author":"P Dickinson","year":"2010","unstructured":"Dickinson, P.: An improved characterisation of the interior of the completely positive cone. Electron. J. Linear Algebra 20, 723\u2013729 (2010)","journal-title":"Electron. J. Linear Algebra"},{"issue":"3","key":"601_CR17","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1137\/110848177","volume":"33","author":"P Dickinson","year":"2012","unstructured":"Dickinson, P., 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":"601_CR18","unstructured":"Dickinson, P., Gijben, L.: On the computational complexity of membership problems for the completely positive cone and its dual (2011). Preprint. Online at http:\/\/www.optimization-online.org\/DB_HTML\/2011\/05\/3041.html"},{"key":"601_CR19","doi-asserted-by":"crossref","unstructured":"Dong, H., Anstreicher, K.: Separating doubly nonnegative and completely positive matrices. Mathematical Programming, in print. Online at doi: 10.1007\/s10107-011-0485-8","DOI":"10.1007\/s10107-011-0485-8"},{"key":"601_CR20","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1080\/03081089408818334","volume":"37","author":"J Drew","year":"1994","unstructured":"Drew, J., Johnson, C., Loewy, R.: Completely positive matrices associated with M-matrices. Linear Multilinear Algebra 37, 303\u2013310 (1994)","journal-title":"Linear Multilinear Algebra"},{"key":"601_CR21","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 \u2014 a 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":"601_CR22","first-page":"48","volume":"17","author":"M D\u00fcr","year":"2008","unstructured":"D\u00fcr, M., Still, G.: Interior points of the completely positive cone. Electron. J. Linear Algebra 17, 48\u201353 (2008)","journal-title":"Electron. J. Linear Algebra"},{"key":"601_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms I","author":"JB Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms I. Springer, Berlin (1993)"},{"key":"601_CR24","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1137\/090750391","volume":"52","author":"JB Hiriart-Urruty","year":"2010","unstructured":"Hiriart-Urruty, J.B., Seeger, A.: A variational approach to copositive matrices. SIAM Rev. 52, 593\u2013629 (2010)","journal-title":"SIAM Rev."},{"issue":"218","key":"601_CR25","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.: On generalized bisection of $$n$$ -simplices. Math. Comput. 66(218), 691\u2013698 (1997)","journal-title":"Math. Comput."},{"key":"601_CR26","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 $${C}^*$$ certificates. J. Glob. Optim. 45, 281\u2013296 (2009)","journal-title":"J. Glob. Optim."},{"key":"601_CR27","volume-title":"Solving Least Squares Problems","author":"C Lawson","year":"1974","unstructured":"Lawson, C., Hanson, R.: Solving Least Squares Problems. Prentice-Hall, Englewood Cliffs (1974)"},{"key":"601_CR28","unstructured":"Leroy, R.: Certificates of positivity in the simplicial Bernstein basis (2011). Preprint. Online at http:\/\/hal.archives-ouvertes.fr\/hal-00589945\/fr\/"},{"key":"601_CR29","first-page":"25","volume":"14","author":"Y Li","year":"2004","unstructured":"Li, Y., Kummert, A., Frommer, A.: A linear programming based analysis of the cp-rank of completely positive matrices. Int. J. Appl. Math. Comput. Sci. 14, 25\u201331 (2004)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"key":"601_CR30","doi-asserted-by":"crossref","unstructured":"L\u00f6fberg, J.: YALMIP : a toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD Conference. Taipei, Taiwan (2004)","DOI":"10.1109\/CACSD.2004.1393890"},{"key":"601_CR31","first-page":"238","volume":"255","author":"J Moreau","year":"1962","unstructured":"Moreau, J.: D\u00e9composition orthogonale d\u2019un espace hilbertien selon deux c\u00f4nes mutuellement polaires. Comptes Rendus Math\u00e9matique. Acad\u00e9mie des Sciences. Paris 255, 238\u2013240 (1962)","journal-title":"Comptes Rendus Math\u00e9matique. Acad\u00e9mie des Sciences. Paris"},{"key":"601_CR32","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, 117\u2013129 (1987)","journal-title":"Math. Program."},{"key":"601_CR33","unstructured":"Parrilo, P.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D. thesis, California Institute of Technology, Pasadena, CA (2000)"},{"issue":"1","key":"601_CR34","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/05064401X","volume":"18","author":"J Pe\u00f1a","year":"2007","unstructured":"Pe\u00f1a, J., Vera, J., Zuluaga, L.: Computing the stability number of a graph via linear and semidefinite programming. SIAM J. Optim. 18(1), 87\u2013105 (2007)","journal-title":"SIAM J. Optim."},{"key":"601_CR35","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"J Sturm","year":"1999","unstructured":"Sturm, J.: Using SeDuMi 1.02, A MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"601_CR36","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1080\/10556788.2010.540014","volume":"27","author":"EA Y\u0131ld\u0131r\u0131m","year":"2012","unstructured":"Y\u0131ld\u0131r\u0131m, E.A.: On the accuracy of uniform polyhedral approximations of the copositive cone. Optim. Methods Softw. 27(1), 155\u2013173 (2012)","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-0601-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0601-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0601-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:00:01Z","timestamp":1559109601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0601-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,27]]},"references-count":36,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["601"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0601-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,27]]}}}