{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T08:13:21Z","timestamp":1783584801036,"version":"3.55.0"},"reference-count":30,"publisher":"Informa UK Limited","issue":"4","funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["788368"],"award-info":[{"award-number":["788368"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004569","name":"Ministry of Science and Higher Education","doi-asserted-by":"publisher","award":["075-10-2021-068"],"award-info":[{"award-number":["075-10-2021-068"]}],"id":[{"id":"10.13039\/501100004569","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002661","name":"Fonds de la Recherche Scientifique - FNRS","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek - Vlanderen (FWO) under EOS","doi-asserted-by":"publisher","award":["O005318F-RG47"],"award-info":[{"award-number":["O005318F-RG47"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"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\/501100000781","name":"European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program","doi-asserted-by":"publisher","award":["788368"],"award-info":[{"award-number":["788368"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2023,7,4]]},"DOI":"10.1080\/10556788.2023.2189714","type":"journal-article","created":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T16:35:10Z","timestamp":1682354110000},"page":"837-859","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":2,"title":["Conic optimization-based algorithms for nonnegative matrix factorization"],"prefix":"10.1080","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3313-1547","authenticated-orcid":false,"given":"Valentin","family":"Leplat","sequence":"first","affiliation":[{"name":"Center for Artificial Intelligence Technology, Skoltech, Moscow, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0542-8757","authenticated-orcid":false,"given":"Yurii","family":"Nesterov","sequence":"additional","affiliation":[{"name":"CORE and ICTEAM\/Mathematical Engineering (INMA), UCLouvain, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6423-6897","authenticated-orcid":false,"given":"Nicolas","family":"Gillis","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Operational Research, Facult\u00e9 Polytechnique, Universit\u00e9 de Mons, Mons, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5890-1093","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Glineur","sequence":"additional","affiliation":[{"name":"CORE and ICTEAM\/Mathematical Engineering (INMA), UCLouvain, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2023,4,24]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-023-02199-z"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1137\/130913869"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1145\/235809.235813"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1142\/5273"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1002\/9780470747278"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1145\/1824777.1824783"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(93)90224-C"},{"key":"CIT0008","unstructured":"J. Dewez, Computational approaches for lower bounds on the nonnegative rank, Ph.D. diss., UCLouvain, 2022."},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.09.028"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2877582"},{"key":"CIT0012","unstructured":"N. Gillis, Approximation et sous-approximation de matrices par factorisation positive : algorithmes,\u00a0complexit\u00e9\u00a0et applications, Master's thesis, Universite Catholique de Louvain, 2007."},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976410"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00256"},{"key":"CIT0015","unstructured":"N. Gillis, Nonnegative matrix factorization: Complexity, algorithms and applications. Unpublished doctoral dissertation, Universit\u00e9 catholique de Louvain. Louvain-La-Neuve: CORE. 2011."},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2009.11.013"},{"key":"CIT0017","unstructured":"M. Jaggi, Sparse convex optimization methods for machine learning, Ph.D. diss., ETH Zurich, 2011."},{"key":"CIT0018","unstructured":"M. Jaggi, Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization, in Proceedings of the 30th International Conference on Machine Learning, Proceedings of Machine Learning Research Vol. 28, 17\u201319 Jun, Atlanta, Georgia, USA. PMLR, 2013, pp. 427\u2013435."},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1137\/110821172"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1137\/19M1279472"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.10"},{"key":"CIT0022","unstructured":"S. Lacoste-Julien, Convergence rate of Frank\u2013Wolfe for non-convex objectives, Preprint (2016). Available at arXiv, 1607.00345."},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1235-y"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.104"},{"key":"CIT0025","unstructured":"Mosek APS, Optimization software. available at https:\/\/www.mosek.com\/."},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00081-8"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080999"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.77"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-015-0350-z"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1137\/070709967"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2023.2189714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T12:33:20Z","timestamp":1689683600000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2023.2189714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,24]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,7,4]]}},"alternative-id":["10.1080\/10556788.2023.2189714"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2023.2189714","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,24]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2022-03-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-01-22","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-04-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}