{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:28:20Z","timestamp":1772296100250,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,5,7]],"date-time":"2009-05-07T00:00:00Z","timestamp":1241654400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10589-009-9251-8","type":"journal-article","created":{"date-parts":[[2009,5,6]],"date-time":"2009-05-06T17:10:30Z","timestamp":1241629830000},"page":"273-307","source":"Crossref","is-referenced-by-count":73,"title":["A coordinate gradient descent method for \u2113 1-regularized convex minimization"],"prefix":"10.1007","volume":"48","author":[{"given":"Sangwoon","family":"Yun","sequence":"first","affiliation":[]},{"given":"Kim-Chuan","family":"Toh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,7]]},"reference":[{"key":"9251_CR1","volume-title":"Nonlinear Programming","author":"D.P. Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"key":"9251_CR2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/ijoc.11.3.217","volume":"11","author":"P.S. Bradley","year":"1999","unstructured":"Bradley, P.S., Fayyad, U.M., Mangasarian, O.L.: Mathematical programming for data mining: formulations and challenges. INFORMS J. Comput. 11, 217\u2013238 (1999)","journal-title":"INFORMS J. Comput."},{"key":"9251_CR3","doi-asserted-by":"crossref","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","volume":"52","author":"E.J. Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Tao, T.: Nearly optimal signal recovery from random projections: Universal encoding strategies. IEEE Trans. Inf. Theory 52, 5406\u20135425 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9251_CR4","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E.J. Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52, 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9251_CR5","unstructured":"Chang, C.-C., Lin, C.-J.: LIBSVM\u2014A library for support vector machines. http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvmtools\/datasets\/"},{"key":"9251_CR6","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"S. Chen","year":"1999","unstructured":"Chen, S., Donoho, D., Saunders, M.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20, 33\u201361 (1999)","journal-title":"SIAM J. Sci. Comput."},{"key":"9251_CR7","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I. Daubechies","year":"2004","unstructured":"Daubechies, I., De Friese, M., De Mol, C.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. 57, 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math."},{"key":"9251_CR8","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D. Donoho","year":"2006","unstructured":"Donoho, D.: Compressed sensing. IEEE Trans. Inf. Theory 52, 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9251_CR9","doi-asserted-by":"crossref","first-page":"4789","DOI":"10.1109\/TIT.2008.929958","volume":"54","author":"D. Donoho","year":"2008","unstructured":"Donoho, D., Tsaig, Y.: Fast solution of \u2113 1-norm minimization problems when the solution may be sparse. IEEE Trans. Inf. Theory 54, 4789\u20134812 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9251_CR10","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B. Efron","year":"2004","unstructured":"Efron, B., Hastie, T., Johnstone, I., Tibshirani, R.: Least angle regression. Ann. Stat. 32, 407\u2013499 (2004)","journal-title":"Ann. Stat."},{"key":"9251_CR11","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1109\/TIP.2003.814255","volume":"12","author":"M. Figueiredo","year":"2003","unstructured":"Figueiredo, M., Nowak, R.: An EM algorithm for wavelet-based image restoration. IEEE Trans. Image Process. 12, 906\u2013916 (2003)","journal-title":"IEEE Trans. Image Process."},{"key":"9251_CR12","unstructured":"Figueiredo, M., Nowak, R.: A bound optimization approach to wavelet-based image deconvolution. In: IEEE Int. Conf. on Image Processing\u2014ICIP\u201905, 2005"},{"key":"9251_CR13","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"M. Figueiredo","year":"2007","unstructured":"Figueiredo, M., Nowak, R., Wright, S.J.: Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. IEEE J. Sel. Top. Signal Process. 1, 586\u2013598 (2007)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"9251_CR14","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1109\/TIT.2004.828141","volume":"50","author":"J.-J. Fuchs","year":"2004","unstructured":"Fuchs, J.-J.: On sparse representations in arbitrary redundant bases. IEEE Trans. Inf. Theory 50, 1341\u20131344 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9251_CR15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1198\/004017007000000245","volume":"49","author":"A. Genkin","year":"2007","unstructured":"Genkin, A., Lewis, D., Madigan, D.: Large-scale Bayesian logistic regression for text categorization. Technometrics 49, 291\u2013304 (2007)","journal-title":"Technometrics"},{"key":"9251_CR16","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1126\/science.286.5439.531","volume":"286","author":"T.R. Golub","year":"1999","unstructured":"Golub, T.R., Slonim, D.K., Tamayo, P., Huard, C., Gaasenbeek, M., Mesirov, J.P., Coller, H., Loh, M.L., Downing, J.R., Caligiuri, M.A., Bloomfield, C.D., Lander, E.S.: Molecular classification of cancer: class discovery and class prediction by gene expression monitoring. Science 286, 531\u2013537 (1999)","journal-title":"Science"},{"key":"9251_CR17","unstructured":"Hale, E.T., Yin, W., Zhang, Y.: A fixed-point continuation method for \u2113 1-regularized minimization with applications to compressed sensing. CAAM Technical report TR07-07, Department of Computational and Applied Mathematics, Rice University (July 2007)"},{"key":"9251_CR18","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1109\/JSTSP.2007.910971","volume":"1","author":"S.-J. Kim","year":"2007","unstructured":"Kim, S.-J., Koh, K., Lustig, M., Boyd, S., Gorinevsky, D.: An interior-point method for large-scale \u2113 1-regularized least squares. IEEE J. Sel. Top. Signal Process. 1, 606\u2013617 (2007)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"9251_CR19","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 \u2113 1-regularized logistic regression. J. Mach. Learn. Res. 8, 1519\u20131555 (2007)","journal-title":"J. Mach. Learn. Res."},{"key":"9251_CR20","unstructured":"Lee, S., Lee, H., Abeel, P., Ng, A.: Efficient \u2113 1-regularized logistic regression. In: Proceedings of the 21st National Conference on Artificial Intelligence, 2006"},{"key":"9251_CR21","first-page":"361","volume":"5","author":"D.D. Lewis","year":"2004","unstructured":"Lewis, D.D., Yang, Y., Rose, T.G., Li, F.: RCV1: A new benchmark collection for text categorization research. J. Mach. Learn. Res. 5, 361\u2013397 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"9251_CR22","first-page":"627","volume":"9","author":"C.-J. Lin","year":"2008","unstructured":"Lin, C.-J., Weng, R.C., Keerthi, S.S.: Trust region Newton method for large-scale logistic regression. J. Mach. Learn. Res. 9, 627\u2013650 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"9251_CR23","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46","author":"Z.-Q. Luo","year":"1993","unstructured":"Luo, Z.-Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46, 157\u2013178 (1993)","journal-title":"Ann. Oper. Res."},{"key":"9251_CR24","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1012422931930","volume":"46","author":"O.L. Mangasarian","year":"2002","unstructured":"Mangasarian, O.L., Musicant, D.R.: Large scale kernel regression via linear programming. Mach. Learn. 46, 255\u2013269 (2002)","journal-title":"Mach. Learn."},{"key":"9251_CR25","unstructured":"Ng, A.Y.: Feature selection, \u2113 1 vs. \u2113 2 regularization, and rotational invariance, In: Proceedings of the 21st International Conference on Machine Learning, 2004"},{"key":"9251_CR26","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1093\/imanum\/20.3.389","volume":"20","author":"M. Osborne","year":"2000","unstructured":"Osborne, M., Presnell, B., Turlach, B.: A new approach to variable selection in least squares problems. IMA J. Numer. Anal. 20, 389\u2013403 (2000)","journal-title":"IMA J. Numer. Anal."},{"key":"9251_CR27","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1111\/j.1467-9868.2007.00607.x","volume":"69","author":"M. Park","year":"2007","unstructured":"Park, M., Hastie, T.: An \u2113 1 regularization-path algorithm for generalized linear models. J. R. Stat. Soc. B 69, 659\u2013677 (2007)","journal-title":"J. R. Stat. Soc. B"},{"key":"9251_CR28","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1198\/1061860043434","volume":"13","author":"S. Sardy","year":"2004","unstructured":"Sardy, S., Tseng, P.: AMlet, RAMlet, and GAMlet: automatic nonlinear fitting of additive models, robust and generalized, with wavelets. J. Comput. Graph. Stat. 13, 283\u2013309 (2004)","journal-title":"J. Comput. Graph. Stat."},{"key":"9251_CR29","doi-asserted-by":"crossref","first-page":"137","DOI":"10.4310\/SII.2008.v1.n1.a12","volume":"1","author":"W. Shi","year":"2008","unstructured":"Shi, W., Wahba, G., Wright, S.J., Lee, K., Klein, R., Klein, B.: Lasso-patternsearch algorithm with application to ophthalmology and genomic data. Stat. Interface 1, 137\u2013153 (2008)","journal-title":"Stat. Interface"},{"key":"9251_CR30","doi-asserted-by":"crossref","first-page":"2279","DOI":"10.1016\/S0165-1684(03)00150-6","volume":"83","author":"J.-L. Starck","year":"2003","unstructured":"Starck, J.-L., Nguyen, M., Murtagh, F.: Wavelets and curvelets for image deconvolution: a combined approach. Signal Process. 83, 2279\u20132283 (2003)","journal-title":"Signal Process."},{"key":"9251_CR31","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1109\/TIT.2005.864420","volume":"51","author":"J.A. Tropp","year":"2006","unstructured":"Tropp, J.A.: Just relax: Convex programming methods for identifying sparse signals. IEEE Trans. Inf. Theory 51, 1030\u20131051 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9251_CR32","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.sigpro.2005.05.028","volume":"86","author":"Y. Tsaig","year":"2005","unstructured":"Tsaig, Y., Donoho, D.: Extensions of compressed sensing. Signal Process. 86, 533\u2013548 (2005)","journal-title":"Signal Process."},{"key":"9251_CR33","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":"9251_CR34","unstructured":"Wang, L.: Efficient regularized solution path algorithms with applications in machine learning and data mining. Ph.D. thesis, University of Michigan (2008)"},{"key":"9251_CR35","doi-asserted-by":"crossref","unstructured":"Wright, S.J., Nowak, R., Figueiredo, M.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. (2007, to appear)","DOI":"10.1109\/ICASSP.2008.4518374"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9251-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-009-9251-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9251-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:36Z","timestamp":1559302596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-009-9251-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,7]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9251"],"URL":"https:\/\/doi.org\/10.1007\/s10589-009-9251-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,7]]}}}