{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T21:46:38Z","timestamp":1769550398850,"version":"3.49.0"},"reference-count":40,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/sam48682.2020.9104264","type":"proceedings-article","created":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T21:02:14Z","timestamp":1591822934000},"page":"1-5","source":"Crossref","is-referenced-by-count":2,"title":["Greedy coordinate descent method on non-negative quadratic programming"],"prefix":"10.1109","author":[{"given":"Chenyu","family":"Wu","sequence":"first","affiliation":[]},{"given":"Yangyang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/140983938"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0170-0"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017501703105"},{"key":"ref31","article-title":"Greedy block coordinate descent (gbcd) method for high dimensional quadratic programs","author":"thoppe","year":"2014","journal-title":"arXiv preprint arXiv 1404 6635"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01437-5"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01425-9"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-018-0037-8"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0892-3"},{"key":"ref34","first-page":"1523","article-title":"Iteration complexity of feasible descent methods for convex optimization","volume":"15","author":"wang","year":"2014","journal-title":"The Journal of Machine Learning Research"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/dry040"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-017-0376-0"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by non-negative matrix factorization","volume":"401","author":"lee","year":"1999","journal-title":"Nature"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2009.3.487"},{"key":"ref13","article-title":"Augmented lagrangian based first-order methods for convex and nonconvex programs: nonergodic convergence and iteration complexity","author":"li","year":"2020","journal-title":"arXiv preprint arXiv 2003 08880"},{"key":"ref14","first-page":"3059","article-title":"An accelerated proximal coordinate gradient method","author":"lin","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/140961134"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF00939948"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/100802001"},{"key":"ref18","article-title":"Greed is good: greedy optimization methods for large-scale structured problems","author":"nutini","year":"2018","journal-title":"PhD thesis"},{"key":"ref19","first-page":"1632","article-title":"Coordinate descent converges faster with the gauss-southwell rule than random selection","author":"nutini","year":"2015","journal-title":"International Conference on Machine Learning"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102451"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-018-0232-4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF00934777"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/130936361"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800040113"},{"key":"ref29","article-title":"A primer on coordinate descent algorithms","author":"shi","year":"2016","journal-title":"arXiv preprint arXiv 1610 04924"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(99)00074-7"},{"key":"ref8","first-page":"1457","article-title":"Non-negative matrix factorization with sparseness constraints","volume":"5","author":"hoyer","year":"2004","journal-title":"Journal of Machine Learning Research"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1057-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/110834524"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.149"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/env.3170050203"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/15M1024950"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.4310\/AMSA.2016.v1.n1.a2"},{"key":"ref24","article-title":"A method for non-linear constraints in minimization problems","author":"powell","year":"1969","journal-title":"Optimization"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2013.6810364"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0614-z"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/120891009"}],"event":{"name":"2020 IEEE 11th Sensor Array and Multichannel Signal Processing Workshop (SAM)","location":"Hangzhou, China","start":{"date-parts":[[2020,6,8]]},"end":{"date-parts":[[2020,6,11]]}},"container-title":["2020 IEEE 11th Sensor Array and Multichannel Signal Processing Workshop (SAM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9102205\/9104219\/09104264.pdf?arnumber=9104264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T21:56:37Z","timestamp":1656453397000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9104264\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/sam48682.2020.9104264","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}