{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T06:32:37Z","timestamp":1778135557838,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,1,27]],"date-time":"2016-01-27T00:00:00Z","timestamp":1453852800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s10107-015-0969-z","type":"journal-article","created":{"date-parts":[[2016,1,27]],"date-time":"2016-01-27T10:00:25Z","timestamp":1453888825000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization"],"prefix":"10.1007","volume":"160","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0713-9131","authenticated-orcid":false,"given":"Xiaoqin","family":"Hua","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuo","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,27]]},"reference":[{"key":"969_CR1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31, 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"key":"969_CR2","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3, 538\u2013543 (1993)","journal-title":"SIAM J. Optim."},{"key":"969_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20, 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"969_CR4","first-page":"1775","volume":"9","author":"M Collins","year":"2008","unstructured":"Collins, M., Globerson, A., Koo, T., Carreras, X., Bartlett, P.: Exponentiated gradient algorithms for conditional random fields and max-margin markov networks. J. Mach. Learn. Res. 9, 1775\u20131822 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"969_CR5","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/090780201","volume":"22","author":"FE Curtis","year":"2012","unstructured":"Curtis, F.E., Overton, M.L.: A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization. SIAM J. Optim. 22, 474\u2013500 (2012)","journal-title":"SIAM J. Optim."},{"key":"969_CR6","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1214\/07-AOAS131","volume":"1","author":"J Friedman","year":"2007","unstructured":"Friedman, J., Hastie, T., H\u00f6fling, H., Tibshirani, R.: Pathwise coordinate optimization. Ann. Appl. Stat. 1, 302\u2013332 (2007)","journal-title":"Ann. Appl. Stat."},{"key":"969_CR7","unstructured":"Hua, X.Q.: Studies on block coordinate gradient methods for nonlinear optimization problems with separate structures, Ph.D. thesis, Graduate school of informatics, Kyoto University, Japan (2015). http:\/\/www-optima.amp.i.kyoto-u.ac.jp\/papers\/doctor\/2015_doctor_hua"},{"key":"969_CR8","first-page":"1519","volume":"8","author":"K Koh","year":"2007","unstructured":"Koh, K., Kim, S.J., Boyd, S.: An interior-point method for large-scale $$l_1$$ l 1 -regularized logistic regression. J. Mach. Learn. Res. 8, 1519\u20131555 (2007)","journal-title":"J. Mach. Learn. Res."},{"key":"969_CR9","doi-asserted-by":"crossref","unstructured":"Liu, H., Palatucci, M., Zhang, J.: Blockwise coordinate descent procedures for the multi-task lasso, with applications to neural semantic basis discovery. In: ICML \u201909 Proceedings of the 26th Annual International Conference on Machine Learning, pp. 649\u2013656 (2009)","DOI":"10.1145\/1553374.1553458"},{"key":"969_CR10","volume-title":"Linear and Nonlinear Programming","author":"DG Luenberger","year":"2003","unstructured":"Luenberger, D.G.: Linear and Nonlinear Programming. Kluwer Academic, Massachusetts (2003)"},{"key":"969_CR11","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2, 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"key":"969_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1111\/j.1467-9868.2007.00627.x","volume":"70","author":"L Meier","year":"2008","unstructured":"Meier, L., Van De Geer, S., B\u00fchlmann, P.: The group lasso for logistic regression. J. R. Stat. Soc. Series B 70, 53\u201371 (2008)","journal-title":"J. R. Stat. Soc. Series B"},{"key":"969_CR13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/0801008","volume":"1","author":"JJ Mor\u00e9","year":"1991","unstructured":"Mor\u00e9, J.J., Toraldo, G.: On the solution of large quadratic programming problems with bound constraints. SIAM J. Optim. 1, 93\u2013113 (1991)","journal-title":"SIAM J. Optim."},{"key":"969_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Springer, The Netherlands (2004)"},{"key":"969_CR15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1190\/1.1440921","volume":"44","author":"HL Taylor","year":"1979","unstructured":"Taylor, H.L., Bank, S.C., McCoy, J.F.: Deconvolution with the $$l_1$$ l 1 norm. Geophysics 44, 39\u201352 (1979)","journal-title":"Geophysics"},{"key":"969_CR16","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10107-010-0394-2","volume":"125","author":"P Tseng","year":"2010","unstructured":"Tseng, P.: Approximation accuracy, gradient methods, and error bound for structured convex optimization. Math. Program. 125, 263\u2013295 (2010)","journal-title":"Math. Program."},{"key":"969_CR17","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P Tseng","year":"2001","unstructured":"Tseng, P.: Convegence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109, 475\u2013494 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"969_CR18","doi-asserted-by":"crossref","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, 387\u2013423 (2009)","journal-title":"Math. Program."},{"key":"969_CR19","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1137\/100808563","volume":"22","author":"SJ Wright","year":"2012","unstructured":"Wright, S.J.: Accelerated block-coordinate relaxation for regularized optimization. SIAM J. Optim. 22, 159\u2013186 (2012)","journal-title":"SIAM J. Optim."},{"key":"969_CR20","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1214\/07-AOAS147","volume":"2","author":"TT Wu","year":"2008","unstructured":"Wu, T.T., Lange, K.: Coordinate descent algorithms for lasso penalized regression. Ann. Appl. Stat. 2, 224\u2013244 (2008)","journal-title":"Ann. Appl. Stat."},{"key":"969_CR21","doi-asserted-by":"crossref","unstructured":"Xu, Y., Yin, W.: A block coordinate descent method for multi-convex optimization with applications to nonnegative tensor factorization and completion, Rice University CAAM Technical Report (2012)","DOI":"10.21236\/ADA567404"},{"key":"969_CR22","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. Series B 68, 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. Series B"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0969-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0969-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0969-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0969-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T21:39:19Z","timestamp":1567546759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0969-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,27]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["969"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0969-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,27]]}}}