{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T18:40:23Z","timestamp":1775155223907,"version":"3.50.1"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,2,4]],"date-time":"2017-02-04T00:00:00Z","timestamp":1486166400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,2,4]],"date-time":"2017-02-04T00:00:00Z","timestamp":1486166400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1317602"],"award-info":[{"award-number":["DMS-1317602"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["MURI W911NF-09-1-0383"],"award-info":[{"award-number":["MURI W911NF-09-1-0383"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s10915-017-0376-0","type":"journal-article","created":{"date-parts":[[2017,2,4]],"date-time":"2017-02-04T18:49:02Z","timestamp":1486234142000},"page":"700-734","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":170,"title":["A Globally Convergent Algorithm for Nonconvex Optimization Based on Block Coordinate Update"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4163-3723","authenticated-orcid":false,"given":"Yangyang","family":"Xu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6697-9731","authenticated-orcid":false,"given":"Wotao","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,4]]},"reference":[{"issue":"11","key":"376_CR1","doi-asserted-by":"publisher","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","volume":"54","author":"M Aharon","year":"2006","unstructured":"Aharon, M., Elad, M., Bruckstein, A.: K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process. 54(11), 4311\u20134322 (2006)","journal-title":"IEEE Trans. Signal Process."},{"key":"376_CR2","unstructured":"Allen, G.: Sparse higher-order principal components analysis. In: International Conference on Artificial Intelligence and Statistics, pp. 27\u201336. (2012)"},{"issue":"1","key":"376_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116(1), 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"2","key":"376_CR4","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka\u2013Lojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"376_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward\u2013backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. 137(1\u20132), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"2","key":"376_CR6","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/s10957-012-0167-6","volume":"157","author":"AM Bagirov","year":"2013","unstructured":"Bagirov, A.M., Jin, L., Karmitsa, N., Al Nuaimat, A., Sultanova, N.: Subgradient method for nonconvex nonsmooth optimization. J. Optim. Theory Appl. 157(2), 416\u2013435 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"376_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage\u2013thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"4","key":"376_CR8","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1137\/120887679","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent type methods. SIAM J. Optim. 23(4), 2037\u20132060 (2013)","journal-title":"SIAM J. Optim."},{"key":"376_CR9","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"issue":"3","key":"376_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath, T., Davies, M.E.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27(3), 265\u2013274 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"4","key":"376_CR11","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The Lojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4), 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"376_CR12","doi-asserted-by":"publisher","first-page":"3319","DOI":"10.1090\/S0002-9947-09-05048-X","volume":"362","author":"J Bolte","year":"2010","unstructured":"Bolte, J., Daniilidis, A., Ley, O., Mazet, L.: Characterizations of \u0142ojasiewicz inequalities: subgradient flows, talweg, convexity. Trans. Am. Math. Soc. 362(6), 3319\u20133363 (2010)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"376_CR13","first-page":"459","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. 146(1), 459\u2013494 (2014)","journal-title":"Math."},{"issue":"1","key":"376_CR14","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1214\/10-AOAS388","volume":"5","author":"P Breheny","year":"2011","unstructured":"Breheny, P., Huang, J.: Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection. Ann. Appl. Stat. 5(1), 232\u2013253 (2011)","journal-title":"Ann. Appl. Stat."},{"issue":"3","key":"376_CR15","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/030601296","volume":"15","author":"JV Burke","year":"2005","unstructured":"Burke, J.V., Lewis, A.S., Overton, M.L.: A robust gradient sampling algorithm for nonsmooth, nonconvex optimization. SIAM J. Optim. 15(3), 751\u2013779 (2005)","journal-title":"SIAM J. Optim."},{"key":"376_CR16","first-page":"1369","volume":"9","author":"KW Chang","year":"2008","unstructured":"Chang, K.W., Hsieh, C.J., Lin, C.J.: Coordinate descent method for large-scale l2-loss linear support vector machines. J. Mach. Learn. Res. 9, 1369\u20131398 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"376_CR17","unstructured":"Chartrand, R., Yin, W.: Iteratively reweighted algorithms for compressive sensing. In: IEEE International Conference on Acoustics, Speech and Signal Processing, 2008. ICASSP 2008, pp. 3869\u20133872. IEEE (2008)"},{"issue":"1","key":"376_CR18","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-012-0569-0","volume":"134","author":"X Chen","year":"2012","unstructured":"Chen, X.: Smoothing methods for nonsmooth, nonconvex minimization. Math. Program. 134(1), 71\u201399 (2012)","journal-title":"Math. Program."},{"key":"376_CR19","unstructured":"Donoho, D., Stodden, V.: When does non-negative matrix factorization give a correct decomposition into parts. In: Advances in Neural Information Processing Systems, vol. 16. (2003)"},{"issue":"456","key":"376_CR20","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"376_CR21","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1137\/S1052623402411459","volume":"14","author":"A Fuduli","year":"2004","unstructured":"Fuduli, A., Gaudioso, M., Giallombardo, G.: Minimizing nonconvex nonsmooth functions via cutting planes and proximity control. SIAM J. Optim. 14(3), 743\u2013756 (2004)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"376_CR22","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156(1), 59\u201399 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"376_CR23","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1080\/10556789908805730","volume":"10","author":"L Grippo","year":"1999","unstructured":"Grippo, L., Sciandrone, M.: Globally convergent block-coordinate techniques for unconstrained optimization. Optim. Methods Softw. 10(4), 587\u2013637 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"376_CR24","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/nav.3800040113","volume":"4","author":"C Hildreth","year":"1957","unstructured":"Hildreth, C.: A quadratic programming procedure. Naval Res. Logist. Q. 4(1), 79\u201385 (1957)","journal-title":"Naval Res. Logist. Q."},{"key":"376_CR25","doi-asserted-by":"crossref","unstructured":"Ho, N., Van Dooren, P., Blondel, V.: Descent methods for nonnegative matrix factorization. In: Numerical Linear Algebra in Signals, Systems and Control, pp. 251\u2013293. Springer, Netherlands (2011)","DOI":"10.1007\/978-94-007-0602-6_13"},{"key":"376_CR26","unstructured":"Hong, M., Wang, X., Razaviyayn, M., Luo, Z.Q.: Iteration complexity analysis of block coordinate descent methods. arXiv preprint arXiv:1310.6957 (2013)"},{"key":"376_CR27","first-page":"1457","volume":"5","author":"P Hoyer","year":"2004","unstructured":"Hoyer, P.: Non-negative matrix factorization with sparseness constraints. J. Mach. Learn. Res. 5, 1457\u20131469 (2004)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"376_CR28","doi-asserted-by":"publisher","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. Global Optim. 58(2), 285\u2013319 (2014)","journal-title":"J. Global Optim."},{"issue":"3","key":"376_CR29","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"T Kolda","year":"2009","unstructured":"Kolda, T., Bader, B.: Tensor decompositions and applications. SIAM Rev. 51(3), 455 (2009)","journal-title":"SIAM Rev."},{"issue":"3","key":"376_CR30","doi-asserted-by":"publisher","first-page":"3325","DOI":"10.1023\/A:1023673105317","volume":"116","author":"AY Kruger","year":"2003","unstructured":"Kruger, A.Y.: On fr\u00e9chet subdifferentials. J. Math. Sci. 116(3), 3325\u20133358 (2003)","journal-title":"J. Math. Sci."},{"key":"376_CR31","doi-asserted-by":"crossref","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. Ann. Inst. Fourier. 48(3), 769\u2013783 (1998)","DOI":"10.5802\/aif.1638"},{"issue":"2","key":"376_CR32","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"MJ Lai","year":"2013","unstructured":"Lai, M.J., Xu, Y., Yin, W.: Improved iteratively reweighted least squares for unconstrained smoothed $$\\ell _q$$ minimization. SIAM J. Numer. Anal. 51(2), 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"issue":"6755","key":"376_CR33","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"D Lee","year":"1999","unstructured":"Lee, D., Seung, H.: Learning the parts of objects by non-negative matrix factorization. Nature 401(6755), 788\u2013791 (1999)","journal-title":"Nature"},{"key":"376_CR34","doi-asserted-by":"crossref","unstructured":"Li, G., Pong, T.K.: Calculus of the exponent of Kurdyka\u2013Lojasiewicz inequality and its applications to linear convergence of first-order methods. arXiv preprint arXiv:1602.02915 (2016)","DOI":"10.1007\/s10208-017-9366-8"},{"key":"376_CR35","unstructured":"Ling, Q., Xu, Y., Yin, W., Wen, Z.: Decentralized low-rank matrix completion. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2012, pp. 2925\u20132928. IEEE (2012)"},{"issue":"5","key":"376_CR36","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.5802\/aif.1384","volume":"43","author":"S \u0141ojasiewicz","year":"1993","unstructured":"\u0141ojasiewicz, S.: Sur la g\u00e9om\u00e9trie semi-et sous-analytique. Ann. Inst. Fourier (Grenoble) 43(5), 1575\u20131595 (1993)","journal-title":"Ann. Inst. Fourier (Grenoble)"},{"key":"376_CR37","unstructured":"Lu, Z., Xiao, L.: Randomized block coordinate non-monotone gradient method for a class of nonlinear programming. arXiv preprint arXiv:1306.5918 (2013)"},{"issue":"1\u20132","key":"376_CR38","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s10107-014-0800-2","volume":"152","author":"Z Lu","year":"2015","unstructured":"Lu, Z., Xiao, L.: On the complexity analysis of randomized block-coordinate descent methods. Math. Program. 152(1\u20132), 615\u2013642 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"376_CR39","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00939948","volume":"72","author":"ZQ Luo","year":"1992","unstructured":"Luo, Z.Q., Tseng, P.: On the convergence of the coordinate descent method for convex differentiable minimization. J. Optim. Theory Appl. 72(1), 7\u201335 (1992)","journal-title":"J. Optim. Theory Appl."},{"key":"376_CR40","doi-asserted-by":"crossref","unstructured":"Mairal, J., Bach, F., Ponce, J., Sapiro, G.: Online dictionary learning for sparse coding. In: Proceedings of the 26th Annual International Conference on Machine Learning, pp. 689\u2013696. ACM (2009)","DOI":"10.1145\/1553374.1553463"},{"issue":"1","key":"376_CR41","first-page":"3441","volume":"13","author":"K Mohan","year":"2012","unstructured":"Mohan, K., Fazel, M.: Iterative reweighted algorithms for matrix rank minimization. J. Mach. Learn. Res. 13(1), 3441\u20133473 (2012)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"376_CR42","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"376_CR43","doi-asserted-by":"publisher","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":"376_CR44","volume-title":"Introductory lectures on convex optimization: a basic course","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Introductory lectures on convex optimization: a basic course, vol. 87. Springer Science & Business Media, Berlin (2013)"},{"key":"376_CR45","volume-title":"Numerical Optimization, Springer Series in Operations Research and Financial Engineering.","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, Springer Series in Operations Research and Financial Engineering., 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"376_CR46","unstructured":"O\u2019Donoghue, B., Candes, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15(3), 715\u2013732 (2013)"},{"issue":"2","key":"376_CR47","doi-asserted-by":"publisher","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":"1","key":"376_CR48","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4310\/AMSA.2016.v1.n1.a2","volume":"1","author":"Z Peng","year":"2016","unstructured":"Peng, Z., Wu, T., Xu, Y., Yan, M., Yin, W.: Coordinate friendly structures, algorithms and applications. Ann. Math. Sci. Appl. 1(1), 57\u2013119 (2016)","journal-title":"Ann. Math. Sci. Appl."},{"issue":"2","key":"376_CR49","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1137\/120891009","volume":"23","author":"M Razaviyayn","year":"2013","unstructured":"Razaviyayn, M., Hong, M., Luo, Z.Q.: A unified convergence analysis of block successive minimization methods for nonsmooth optimization. SIAM J. Optim. 23(2), 1126\u20131153 (2013)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"376_CR50","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"issue":"1","key":"376_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richt\u00e1rik","year":"2014","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math. Program. 144(1), 1\u201338 (2014)","journal-title":"Math. Program."},{"key":"376_CR52","volume-title":"Variational Analysis","author":"R Rockafellar","year":"2009","unstructured":"Rockafellar, R., Wets, R.: Variational Analysis, vol. 317. Springer, Berlin (2009)"},{"issue":"1","key":"376_CR53","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1137\/110840054","volume":"23","author":"A Saha","year":"2013","unstructured":"Saha, A., Tewari, A.: On the nonasymptotic convergence of cyclic coordinate descent methods. SIAM J. Optim. 23(1), 576\u2013601 (2013)","journal-title":"SIAM J. Optim."},{"key":"376_CR54","unstructured":"Shi, H.J.M., Tu, S., Xu, Y., Yin, W.: A primer on coordinate descent algorithms. arXiv preprint arXiv:1610.00040 (2016)"},{"issue":"3","key":"376_CR55","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P Tseng","year":"2001","unstructured":"Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109(3), 475\u2013494 (2001)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"376_CR56","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117(1), 387\u2013423 (2009)","journal-title":"Math. Program."},{"issue":"12","key":"376_CR57","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1016\/S0167-8655(01)00070-8","volume":"22","author":"M Welling","year":"2001","unstructured":"Welling, M., Weber, M.: Positive tensor factorization. Pattern Recogn. Lett. 22(12), 1255\u20131261 (2001)","journal-title":"Pattern Recogn. Lett."},{"issue":"4","key":"376_CR58","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","volume":"4","author":"Z Wen","year":"2012","unstructured":"Wen, Z., Yin, W., Zhang, Y.: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math. Program. Comput. 4(4), 333\u2013361 (2012)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"376_CR59","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s12532-014-0074-y","volume":"7","author":"Y Xu","year":"2015","unstructured":"Xu, Y.: Alternating proximal gradient method for sparse nonnegative tucker decomposition. Math. Program. Comput. 7(1), 39\u201370 (2015)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"376_CR60","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s10044-015-0485-z","volume":"19","author":"Y Xu","year":"2016","unstructured":"Xu, Y., Akrotirianakis, I., Chakraborty, A.: Proximal gradient method for huberized support vector machine. Pattern Anal. Appl. 19(4), 989\u20131005 (2016)","journal-title":"Pattern Anal. Appl."},{"issue":"3","key":"376_CR61","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Y Xu","year":"2013","unstructured":"Xu, Y., Yin, W.: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J. Imaging Sci. 6(3), 1758\u20131789 (2013)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"376_CR62","doi-asserted-by":"publisher","first-page":"563","DOI":"10.3934\/ipi.2016012","volume":"10","author":"Y Xu","year":"2016","unstructured":"Xu, Y., Yin, W.: A fast patch-dictionary method for whole image recovery. Inverse Probl. Imaging 10(2), 563\u2013583 (2016)","journal-title":"Inverse Probl. Imaging"},{"issue":"2","key":"376_CR63","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10915-017-0376-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-017-0376-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-017-0376-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T14:11:40Z","timestamp":1658585500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10915-017-0376-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,4]]},"references-count":63,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["376"],"URL":"https:\/\/doi.org\/10.1007\/s10915-017-0376-0","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,4]]},"assertion":[{"value":"14 March 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}