{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T08:34:29Z","timestamp":1776328469013,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T00:00:00Z","timestamp":1521590400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["679515"],"award-info":[{"award-number":["679515"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS","doi-asserted-by":"publisher","award":["F.4501.16"],"award-info":[{"award-number":["F.4501.16"]}],"id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Concerted Research Action","award":["ARC 14\/19-060"],"award-info":[{"award-number":["ARC 14\/19-060"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10589-018-9998-x","type":"journal-article","created":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T09:11:41Z","timestamp":1521623501000},"page":"193-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Algorithms for positive semidefinite factorization"],"prefix":"10.1007","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8181-3043","authenticated-orcid":false,"given":"Arnaud","family":"Vandaele","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Glineur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Gillis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,21]]},"reference":[{"key":"9998_CR1","doi-asserted-by":"publisher","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)"},{"issue":"2","key":"9998_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S Burer","year":"2003","unstructured":"Burer, S., Monteiro, R.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. 95(2), 329\u2013357 (2003)","journal-title":"Math. Program."},{"key":"9998_CR3","volume-title":"Ars Magna or the Rules of Algebra","author":"G Cardano","year":"1968","unstructured":"Cardano, G.: Ars Magna or the Rules of Algebra. Dover Publications, Mineola (1968)"},{"issue":"3","key":"9998_CR4","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1587\/transfun.E92.A.708","volume":"E92\u2013A","author":"A Cichocki","year":"2009","unstructured":"Cichocki, A., Phan, A.H.: Fast local algorithms for large scale nonnegative matrix and tensor factorizations. IEICE Trans. Fundam. Electron. E92\u2013A(3), 708\u2013721 (2009)","journal-title":"IEICE Trans. Fundam. Electron."},{"key":"9998_CR5","doi-asserted-by":"crossref","unstructured":"Cichocki, A., Zdunek, R., Amari, S.i.: Hierarchical ALS algorithms for nonnegative matrix and 3D tensor factorization. In: International Conference on Independent Component Analysis and Signal Separation, pp. 169\u2013176. Springer (2007)","DOI":"10.1007\/978-3-540-74494-8_22"},{"issue":"1","key":"9998_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10107-015-0922-1","volume":"153","author":"H Fawzi","year":"2015","unstructured":"Fawzi, H., Gouveia, J., Parrilo, P., Robinson, R., Thomas, R.: Positive semidefinite rank. Math. Program. 153(1), 133\u2013177 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"9998_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.orl.2015.11.012","volume":"44","author":"H Fawzi","year":"2016","unstructured":"Fawzi, H., Gouveia, J., Robinson, R.: Rational and real positive semidefinite rank can be different. Oper. Res. Lett. 44(1), 59\u201360 (2016)","journal-title":"Oper. Res. Lett."},{"key":"9998_CR8","doi-asserted-by":"crossref","unstructured":"Fiorini, S., Massar, S., Pokutta, S., Tiwary, H., de Wolf, R.: Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing, pp. 95\u2013106. ACM (2012)","DOI":"10.1145\/2213977.2213988"},{"issue":"3","key":"9998_CR9","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1007\/s00454-012-9421-9","volume":"48","author":"S Fiorini","year":"2012","unstructured":"Fiorini, S., Rothvoss, T., Tiwary, H.: Extended formulations for polygons. Discrete Comput. Geom. 48(3), 658\u2013668 (2012)","journal-title":"Discrete Comput. Geom."},{"key":"9998_CR10","volume-title":"Regularization, Optimization, Kernels, and Support Vector Machines\u2018","author":"N Gillis","year":"2014","unstructured":"Gillis, N.: The why and how of nonnegative matrix factorization. In: Suykens, J., Signoretto, M., Argyriou, A. (eds.) Regularization, Optimization, Kernels, and Support Vector Machines\u2018. Chapman & Hall\/CRC, Boca Raton (2014). Machine Learning and Pattern Recognition Series"},{"issue":"4","key":"9998_CR11","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1162\/NECO_a_00256","volume":"24","author":"N Gillis","year":"2012","unstructured":"Gillis, N., Glineur, F.: Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization. Neural Comput. 24(4), 1085\u20131105 (2012)","journal-title":"Neural Comput."},{"issue":"4","key":"9998_CR12","doi-asserted-by":"publisher","first-page":"2612","DOI":"10.1137\/16M1105608","volume":"31","author":"A Goucha","year":"2017","unstructured":"Goucha, A., Gouveia, J., Silva, P.: On ranks of regular polygons. SIAM J. Discrete Math. 31(4), 2612\u20132625 (2017)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"9998_CR13","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1287\/moor.1120.0575","volume":"38","author":"J Gouveia","year":"2013","unstructured":"Gouveia, J., Parrilo, P., Thomas, R.: Lifts of convex sets and cone factorizations. Math. Oper. Res. 38(2), 248\u2013264 (2013)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9998_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10107-015-0867-4","volume":"153","author":"J Gouveia","year":"2015","unstructured":"Gouveia, J., Robinson, R., Thomas, R.: Worst-case results for positive semidefinite rank. Math. Program. 153(1), 201\u2013212 (2015)","journal-title":"Math. Program."},{"key":"9998_CR15","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.laa.2016.10.015","volume":"513","author":"S Gribling","year":"2017","unstructured":"Gribling, S., de Laat, D., Laurent, M.: Matrices with high completely positive semidefinite rank. Linear Algebra Appl. 513, 122\u2013148 (2017)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"9998_CR16","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0167-6377(99)00074-7","volume":"26","author":"L Grippo","year":"2000","unstructured":"Grippo, L., Sciandrone, M.: On the convergence of the block nonlinear gauss-seidel method under convex constraints. Oper. Res. Lett. 26(3), 127\u2013136 (2000)","journal-title":"Oper. Res. Lett."},{"key":"9998_CR17","unstructured":"Ho, N.D.: Nonnegative matrix factorization algorithms and applications. Ph.D. thesis, Univertsit\u00e9 catholique de Louvain (2008)"},{"key":"9998_CR18","doi-asserted-by":"crossref","unstructured":"Hsieh, C.J., Dhillon, I.: Fast coordinate descent methods with variable selection for non-negative matrix factorization. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1064\u20131072. ACM (2011)","DOI":"10.1145\/2020408.2020577"},{"key":"9998_CR19","first-page":"2","volume":"85","author":"V Kaibel","year":"2011","unstructured":"Kaibel, V.: Extended formulations in combinatorial optimization. Optima 85, 2\u20137 (2011)","journal-title":"Optima"},{"issue":"3","key":"9998_CR20","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10898-014-0247-2","volume":"62","author":"D Kuang","year":"2015","unstructured":"Kuang, D., Yun, S., Park, H.: SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering. J. Glob. Optim. 62(3), 545\u2013574 (2015)","journal-title":"J. Glob. Optim."},{"key":"9998_CR21","doi-asserted-by":"crossref","unstructured":"Kubjas, K., Robeva, E., Robinson, R.: Positive semidefinite rank and nested spectrahedra. Linear Multilinear Algebra. 1\u201323 (2017)","DOI":"10.1080\/03081087.2017.1381664"},{"key":"9998_CR22","unstructured":"Lee, T., Theis, D.O.: Support-based lower bounds for the positive semidefinite rank of a nonnegative matrix. (2012). arXiv preprint arXiv:1203.3961"},{"key":"9998_CR23","doi-asserted-by":"crossref","unstructured":"L\u00f6fberg, J.: Yalmip: A toolbox for modeling and optimization in matlab. In: IEEE International Symposium on Computer Aided Control Systems Design, 2004, pp. 284\u2013289. IEEE (2004)","DOI":"10.1109\/CACSD.2004.1393890"},{"key":"9998_CR24","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate 0(1\/k2). Sov. Math. Dokl. 27, 372\u2013376 (1983)","journal-title":"Sov. Math. Dokl."},{"key":"9998_CR25","doi-asserted-by":"crossref","unstructured":"Prakash, A., Sikora, J., Varvitsiotis, A., Wei, Z.: Completely positive semidefinite rank. Math. Program. 1\u201335 (2016)","DOI":"10.1007\/s10107-017-1198-4"},{"issue":"3","key":"9998_CR26","doi-asserted-by":"publisher","first-page":"1898","DOI":"10.1137\/16M1080616","volume":"27","author":"Y Shitov","year":"2017","unstructured":"Shitov, Y.: The complexity of positive semidefinite matrix factorization. SIAM J. Optim. 27(3), 1898\u20131909 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1\u20134","key":"9998_CR27","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using sedumi 1.02, a matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11(1\u20134), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"9998_CR28","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.laa.2016.12.023","volume":"521","author":"A Vandaele","year":"2017","unstructured":"Vandaele, A., Gillis, N., Glineur, F.: On the linear extension complexity of regular n-gons. Linear Algebra Appl. 521, 217\u2013239 (2017)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"9998_CR29","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10898-015-0350-z","volume":"65","author":"A Vandaele","year":"2016","unstructured":"Vandaele, A., Gillis, N., Glineur, F., Tuyttens, D.: Heuristics for exact nonnegative matrix factorization. J. Glob. Optim. 65(2), 369\u2013400 (2016)","journal-title":"J. Glob. Optim."},{"issue":"21","key":"9998_CR30","doi-asserted-by":"publisher","first-page":"5571","DOI":"10.1109\/TSP.2016.2591510","volume":"64","author":"A Vandaele","year":"2016","unstructured":"Vandaele, A., Gillis, N., Lei, Q., Zhong, K., Dhillon, I.: Efficient and non-convex coordinate descent for symmetric nonnegative matrix factorization. IEEE Trans. Signal Process. 64(21), 5571\u20135584 (2016)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"9998_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"S Wright","year":"2015","unstructured":"Wright, S.: Coordinate descent algorithms. Math. Program. 151(1), 3\u201334 (2015)","journal-title":"Math. Program."},{"issue":"3","key":"9998_CR32","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0022-0000(91)90024-Y","volume":"43","author":"M Yannakakis","year":"1991","unstructured":"Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci. 43(3), 441\u2013466 (1991)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-9998-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-9998-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-9998-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,13]],"date-time":"2019-10-13T06:08:48Z","timestamp":1570946928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-9998-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,21]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["9998"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-9998-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,21]]},"assertion":[{"value":"26 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}