{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:14:08Z","timestamp":1749615248728,"version":"3.41.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,10,4]],"date-time":"2016-10-04T00:00:00Z","timestamp":1475539200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Asian Office of Aerospace R and D","award":["FA2386-15-1-4006"],"award-info":[{"award-number":["FA2386-15-1-4006"]}]},{"name":"Vietnam Ministry of Education and Training","award":["911 Scholarship"],"award-info":[{"award-number":["911 Scholarship"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10898-016-0471-z","type":"journal-article","created":{"date-parts":[[2016,10,4]],"date-time":"2016-10-04T16:17:05Z","timestamp":1475597825000},"page":"307-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization"],"prefix":"10.1007","volume":"68","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,10,4]]},"reference":[{"key":"471_CR1","doi-asserted-by":"publisher","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: volume 2: statistical, bayesian, time series and other theoretical aspects, pp 99\u2013134. Springer, Berlin, Heidelberg (2012). doi: 10.1007\/978-3-642-23241-1_6","DOI":"10.1007\/978-3-642-23241-1_6"},{"key":"471_CR2","unstructured":"Hel\u00e9n, M., Virtanen, T.: Separation of drums from polyphonic music using non-negative matrix factorization and support vector machine. In: Proceedings of the EUSIPCO, vol. 2005 (2005)"},{"key":"471_CR3","unstructured":"Donoho, D., Stodden, V.: When does non-negative matrix factorization give a correct decomposition into parts? In: Advances in Neural Information Processing Systems 16: Proceedings of the 2003 Conference. MIT Press (2004)"},{"key":"471_CR4","first-page":"257","volume":"12","author":"N Gillis","year":"2014","unstructured":"Gillis, N.: The why and how of nonnegative matrix factorization. Regul. Optim. Kernels Support Vector Mach. 12, 257 (2014)","journal-title":"Regul. Optim. Kernels Support Vector Mach."},{"issue":"6755","key":"471_CR5","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"D Lee","year":"1999","unstructured":"Lee, D., Seung, H., et al.: Learning the parts of objects by non-negative matrix factorization. Nature 401(6755), 788\u2013791 (1999)","journal-title":"Nature"},{"issue":"2","key":"471_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/env.3170050203","volume":"5","author":"P Paatero","year":"1994","unstructured":"Paatero, P., Tapper, U.: Positive matrix factorization: a non-negative factor model with optimal utilization of error estimates of data values. Environmetrics 5(2), 111\u2013126 (1994)","journal-title":"Environmetrics"},{"issue":"6","key":"471_CR7","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1109\/TKDE.2012.51","volume":"25","author":"YX Wang","year":"2013","unstructured":"Wang, Y.X., Zhang, Y.J.: Nonnegative matrix factorization: a comprehensive review. IEEE Trans. Knowl. Data Eng. 25(6), 1336\u20131353 (2013). doi: 10.1109\/TKDE.2012.51","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"471_CR8","unstructured":"Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Leen, T.K., Dietterich, T.G., Tresp, V. (eds.) Advances in neural information processing systems, pp. 556\u2013562. MIT Press (2001). http:\/\/papers.nips.cc\/paper\/1861-algorithmsfor-non-negative-matrix-factorization.pdf"},{"issue":"10","key":"471_CR9","doi-asserted-by":"crossref","first-page":"1594","DOI":"10.1080\/03610918.2011.589734","volume":"40","author":"ZY Zhang","year":"2011","unstructured":"Zhang, Z.Y.: Divergence functions of non negative matrix factorization: a comparison study. Commun. Stat. Simul. Comput. 40(10), 1594\u20131612 (2011)","journal-title":"Commun. Stat. Simul. Comput."},{"key":"471_CR10","first-page":"1457","volume":"5","author":"PO Hoyer","year":"2004","unstructured":"Hoyer, P.O.: Non-negative matrix factorization with sparseness constraints. J. Mach. Learn. Res. 5, 1457\u20131469 (2004)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"471_CR11","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1109\/TPAMI.2006.60","volume":"28","author":"A Pascual-Montano","year":"2006","unstructured":"Pascual-Montano, A., Carazo, J.M., Kochi, K., Lehmann, D., Pascual-Marqui, R.D.: Nonsmooth nonnegative matrix factorization (nsnmf). IEEE Trans. Pattern Anal. Mach. Intell. 28(3), 403\u2013415 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"471_CR12","doi-asserted-by":"crossref","unstructured":"Choi, S.: Algorithms for orthogonal nonnegative matrix factorization. In: Neural Networks, 2008. IJCNN 2008. IEEE World Congress on Computational Intelligence, IEEE International Joint Conference on, pp. 1828\u20131832. IEEE (2008)","DOI":"10.1109\/IJCNN.2008.4634046"},{"issue":"1\u20132","key":"471_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s11265-006-0039-0","volume":"48","author":"H Li","year":"2007","unstructured":"Li, H., Adal, T., Wang, W., Emge, D., Cichocki, A.: Non-negative matrix factorization with orthogonality constraints and its application to raman spectroscopy. J. VLSI Signal Process. Syst. Signal Image Video Technol. 48(1\u20132), 83\u201397 (2007)","journal-title":"J. VLSI Signal Process. Syst. Signal Image Video Technol."},{"issue":"2","key":"471_CR14","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10115-010-0352-6","volume":"29","author":"C Thurau","year":"2011","unstructured":"Thurau, C., Kersting, K., Wahabzada, M., Bauckhage, C.: Convex non-negative matrix factorization for massive datasets. Knowl. Inf. Syst. 29(2), 457\u2013478 (2011)","journal-title":"Knowl. Inf. Syst."},{"issue":"10","key":"471_CR15","doi-asserted-by":"crossref","first-page":"e77162","DOI":"10.1371\/journal.pone.0077162","volume":"8","author":"N Guan","year":"2013","unstructured":"Guan, N., Wei, L., Luo, Z., Tao, D.: Limited-memory fast gradient descent method for graph regularized nonnegative matrix factorization. PloS One 8(10), e77162 (2013)","journal-title":"PloS One"},{"key":"471_CR16","doi-asserted-by":"crossref","unstructured":"Liu, C., Yang, H.C., Fan, J., He, L.W., Wang, Y.M.: Distributed nonnegative matrix factorization for web-scale dyadic data analysis on mapreduce. In: Proceedings of the 19th International Conference on World Wide Web, pp. 681\u2013690. ACM (2010)","DOI":"10.1145\/1772690.1772760"},{"issue":"10","key":"471_CR17","doi-asserted-by":"crossref","first-page":"2756","DOI":"10.1162\/neco.2007.19.10.2756","volume":"19","author":"CJ Lin","year":"2007","unstructured":"Lin, C.J.: Projected gradient methods for nonnegative matrix factorization. Neural Comput. 19(10), 2756\u20132779 (2007)","journal-title":"Neural Comput."},{"key":"471_CR18","doi-asserted-by":"crossref","unstructured":"Kim, D., Sra, S., Dhillon, I.S.: Fast newton-type methods for the least squares nonnegative matrix approximation problem. In: SDM, pp. 343\u2013354. SIAM (2007)","DOI":"10.1137\/1.9781611972771.31"},{"key":"471_CR19","doi-asserted-by":"crossref","unstructured":"Zdunek, R., Cichocki, A.: Non-negative matrix factorization with quasi-newton optimization. In: Artificial Intelligence and Soft Computing-ICAISC 2006, pp. 870\u2013879. Springer (2006)","DOI":"10.1007\/11785231_91"},{"issue":"2","key":"471_CR20","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/07069239X","volume":"30","author":"H Kim","year":"2008","unstructured":"Kim, H., Park, H.: Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method. SIAM J. Matrix Anal. Appl. 30(2), 713\u2013730 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"471_CR21","doi-asserted-by":"crossref","unstructured":"Kim, J., Park, H.: Toward faster nonnegative matrix factorization: a new algorithm and comparisons. In: Data Mining, 2008. ICDM\u201908. Eighth IEEE International Conference on, pp. 353\u2013362. IEEE (2008)","DOI":"10.1109\/ICDM.2008.149"},{"key":"471_CR22","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"},{"issue":"4","key":"471_CR23","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":"471_CR24","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. Signal Process. 60(6), 2882\u20132898 (2012)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"471_CR25","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10898-013-0035-4","volume":"58","author":"J Kim","year":"2014","unstructured":"Kim, J., He, Y., Park, H.: Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework. J. Glob. Optim. 58(2), 285\u2013319 (2014)","journal-title":"J. Glob. Optim."},{"issue":"6","key":"471_CR26","doi-asserted-by":"crossref","first-page":"1589","DOI":"10.1109\/TNN.2007.895831","volume":"18","author":"CJ Lin","year":"2007","unstructured":"Lin, C.J.: On the convergence of multiplicative update algorithms for nonnegative matrix factorization. IEEE Trans. Neural Netw. 18(6), 1589\u20131596 (2007)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"1","key":"471_CR27","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.csda.2006.11.006","volume":"52","author":"MW Berry","year":"2007","unstructured":"Berry, M.W., Browne, M., Langville, A.N., Pauca, V.P., Plemmons, R.J.: Algorithms and applications for approximate nonnegative matrix factorization. Comput. Stat. Data Anal. 52(1), 155\u2013173 (2007)","journal-title":"Comput. Stat. Data Anal."},{"issue":"4","key":"471_CR28","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1093\/imanum\/drq024","volume":"31","author":"S Bonettini","year":"2011","unstructured":"Bonettini, S.: Inexact block coordinate descent methods with application to non-negative matrix factorization. IMA J. Numer. Anal. 31(4), 1431\u20131452 (2011)","journal-title":"IMA J. Numer. Anal."},{"key":"471_CR29","unstructured":"Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Advances in Neural Information Processing Systems, pp. 556\u2013562 (2001)"},{"key":"471_CR30","doi-asserted-by":"publisher","unstructured":"Cichocki, A., Zdunek, R., Amari, S.i.: Hierarchical als algorithms for nonnegative matrix and 3d tensor factorization. In: Davies, M.E., James, C.J., Abdallah, S.A., Plumbley, M.D. (eds.) Proceedings of 7th international conference on independent component analysis and signal separation, ICA 2007, pp. 169\u2013176, London, UK, September 9\u201312, 2007. Springer, Berlin, Heidelberg (2007). doi: 10.1007\/978-3-540-74494-8_22","DOI":"10.1007\/978-3-540-74494-8_22"},{"key":"471_CR31","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":"5","key":"471_CR32","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":"471_CR33","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)"},{"issue":"5","key":"471_CR34","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1080\/10556788.2012.656368","volume":"28","author":"SS Kim Dongmin","year":"2013","unstructured":"Kim Dongmin, S.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."},{"key":"471_CR35","volume-title":"A New Projected Quasi-Newton Approach for the Nonnegative Least Squares Problem","author":"D Kim","year":"2006","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, Austin (2006)"},{"key":"471_CR36","doi-asserted-by":"publisher","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 11th international conference on computer analysis of images and patterns, CAIP 2005, pp. 407\u2013414, Versailles, France, September 5\u20138, 2005. Springer, Berlin, Heidelberg (2005). doi: 10.1007\/11556121_50","DOI":"10.1007\/11556121_50"},{"key":"471_CR37","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":"471_CR38","unstructured":"Nguyen, D.K., Ho, T.B.: Anti-lopsided algorithm for large-scale nonnegative least square problems. arXiv:1502.01645 (2015)"},{"key":"471_CR39","doi-asserted-by":"crossref","unstructured":"Gemulla, R., Nijkamp, E., Haas, P.J., Sismanis, Y.: Large-scale matrix factorization with distributed stochastic gradient descent. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 69\u201377. ACM (2011)","DOI":"10.1145\/2020408.2020426"},{"key":"471_CR40","doi-asserted-by":"crossref","unstructured":"Sun, Z., Li, T., Rishe, N.: Large-scale matrix factorization using mapreduce. In: 2010 IEEE International Conference on Data Mining Workshops (ICDMW), pp. 1242\u20131248. IEEE (2010)","DOI":"10.1109\/ICDMW.2010.155"},{"issue":"2","key":"471_CR41","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"key":"471_CR42","unstructured":"Schmidt, M., Friedlander, M.: Coordinate descent converges faster with the gauss-southwell rule than random selection. In: NIPS OPT-ML Workshop (2014)"},{"issue":"1","key":"471_CR43","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.laa.2005.06.025","volume":"416","author":"VP Pauca","year":"2006","unstructured":"Pauca, V.P., Piper, J., Plemmons, R.J.: Nonnegative matrix factorization for spectral data analysis. Linear Algebra Appl. 416(1), 29\u201347 (2006)","journal-title":"Linear Algebra Appl."},{"key":"471_CR44","unstructured":"Caramanis, L., Jo, S.J.: EE 381V: Large scale optimization fall 2012. http:\/\/sers.ece.utexas.edu\/~cmcaram\/EE381V_2012F\/Lecture_4_Scribe_Notes.final.pdf"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0471-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-016-0471-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0471-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T22:40:46Z","timestamp":1749595246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-016-0471-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,4]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["471"],"URL":"https:\/\/doi.org\/10.1007\/s10898-016-0471-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2016,10,4]]}}}