{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,15]],"date-time":"2023-03-15T15:11:12Z","timestamp":1678893072334},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"322 Scholarship from Vietnam Ministry of Education","award":["3359"],"award-info":[{"award-number":["3359"]}]},{"name":"Asian Office of Aerospace R and D","award":["FA2386-15-1-4006"],"award-info":[{"award-number":["FA2386-15-1-4006"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s41060-016-0037-7","type":"journal-article","created":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T10:18:36Z","timestamp":1480587516000},"page":"23-34","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Accelerated anti-lopsided algorithm for nonnegative least squares"],"prefix":"10.1007","volume":"3","author":[{"given":"Duy Khuong","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tu Bao","family":"Ho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,1]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"5","key":"37_CR2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/(SICI)1099-128X(199709\/10)11:5<393::AID-CEM483>3.0.CO;2-L","volume":"11","author":"R Bro","year":"1997","unstructured":"Bro, R., De Jong, S.: A fast non-negativity-constrained least squares algorithm. J. Chemom. 11(5), 393\u2013401 (1997)","journal-title":"J. Chemom."},{"key":"37_CR3","unstructured":"Caramanis, L., Jo, S.J.: Ee 381v: large scale optimization fall 2012. http:\/\/users.ece.utexas.edu\/~cmcaram\/EE381V_2012F\/Lecture_4_Scribe_Notes.final.pdf (2012)"},{"issue":"5","key":"37_CR4","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/MSP.2014.2329397","volume":"31","author":"V Cevher","year":"2014","unstructured":"Cevher, V., Becker, S., Schmidt, M.: Convex optimization for big data: scalable, randomized, and parallel algorithms for big data analytics. Sig. Process. Mag. IEEE 31(5), 32\u201343 (2014)","journal-title":"Sig. Process. Mag. IEEE"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Chen, D., Plemmons, R.J.: Nonnegativity constraints in numerical analysis. In: Symposium on the Birth of Numerical Analysis, pp. 109\u2013140 (2009)","DOI":"10.1142\/9789812836267_0008"},{"issue":"1","key":"37_CR6","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/103147.103155","volume":"17","author":"A Dax","year":"1991","unstructured":"Dax, A.: On computational aspects of bounded linear least squares problems. ACM Trans. Math. Softw. (TOMS) 17(1), 64\u201373 (1991)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Franc, V., Hlav\u00e1\u010d, V., Navara, M.: Sequential coordinate-wise algorithm for the non-negative least squares problem. In: Gagalowicz, A., Philips, W (eds.) Proceedings of the 11th International Conference, CAIP 2005, Versailles, France, September 5-8, 2005. Computer Analysis of Images and Patterns, pp. 407\u2013414. Springer, Berlin (2005)","DOI":"10.1007\/11556121_50"},{"key":"37_CR8","volume-title":"Practical Optimization. 1981","author":"PE Gill","year":"1987","unstructured":"Gill, P.E., Murray, W., Wright, M.H.: Practical Optimization. 1981. Academic, London (1987)"},{"issue":"4","key":"37_CR9","doi-asserted-by":"crossref","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":"6","key":"37_CR10","doi-asserted-by":"crossref","first-page":"2882","DOI":"10.1109\/TSP.2012.2190406","volume":"60","author":"N Guan","year":"2012","unstructured":"Guan, N., Tao, D., Luo, Z., Yuan, B.: NeNMF: an optimal gradient method for nonnegative matrix factorization. IEEE Trans. Sig. Process. 60(6), 2882\u20132898 (2012)","journal-title":"IEEE Trans. Sig. Process."},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Hsieh, C.J., Dhillon, I.S.: 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":"37_CR12","unstructured":"Kim, D., Sra, S., Dhillon, I.S.: A new projected quasi-Newton approach for the nonnegative least squares problem. Computer Science Department, University of Texas at Austin (2006)"},{"issue":"5","key":"37_CR13","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1080\/10556788.2012.656368","volume":"28","author":"D Kim","year":"2013","unstructured":"Kim, D., Sra, S., Dhillon, I.S.: A non-monotonic method for large-scale non-negative least squares. Optim. Methods Softw. 28(5), 1012\u20131039 (2013)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"37_CR14","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"key":"37_CR15","volume-title":"Solving Least Squares Problems","author":"CL Lawson","year":"1974","unstructured":"Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems, vol. 161. SIAM, Philadelphia (1974)"},{"key":"37_CR16","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $$o (1\/k^2)$$ o ( 1 \/ k 2 ) . Sov. Math. Dokl. 27, 372\u2013376 (1983)","journal-title":"Sov. Math. Dokl."},{"key":"37_CR17","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. Core Discussion Papers 2010002, Universit\u00e9 Catholique de Louvain. Center for Operations Research and Econometrics (CORE) (2010)"},{"issue":"3","key":"37_CR18","first-page":"123","volume":"1","author":"N Parikh","year":"2013","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 123\u2013231 (2013)","journal-title":"Found. Trends Optim."},{"key":"37_CR19","unstructured":"Potluru, V.K.: Frugal coordinate descent for large-scale NNLS. In: AAAI (2012)"},{"key":"37_CR20","unstructured":"Schmidt, M., Friedlander, M.: Coordinate descent converges faster with the Gauss\u2013Southwell rule than random selection. In: NIPS OPT-ML Workshop (2014)"},{"issue":"10","key":"37_CR21","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1002\/cem.889","volume":"18","author":"MH Benthem Van","year":"2004","unstructured":"Van Benthem, M.H., Keenan, M.R.: Fast algorithm for the solution of large-scale non-negativity-constrained least squares problems. J. Chemom. 18(10), 441\u2013450 (2004)","journal-title":"J. Chemom."},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, Z.-Y.: Nonnegative matrix factorization: models, algorithms and applications. In: Holmes, D.E., Jain, L.C. (eds.) Data Mining: Foundations and Intelligent Paradigms, vol. 2. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-23241-1_6"},{"issue":"3","key":"37_CR23","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/MSP.2014.2298891","volume":"31","author":"G Zhou","year":"2014","unstructured":"Zhou, G., Cichocki, A., Zhao, Q., Xie, S.: Nonnegative matrix and tensor factorizations: an algorithmic perspective. Sig. Process. Mag. IEEE 31(3), 54\u201365 (2014)","journal-title":"Sig. Process. Mag. IEEE"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-016-0037-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41060-016-0037-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-016-0037-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T04:58:32Z","timestamp":1498366712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41060-016-0037-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["37"],"URL":"https:\/\/doi.org\/10.1007\/s41060-016-0037-7","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,1]]}}}