{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T20:36:55Z","timestamp":1780346215143,"version":"3.54.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,3,26]],"date-time":"2014-03-26T00:00:00Z","timestamp":1395792000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10208-014-9189-9","type":"journal-article","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T20:30:03Z","timestamp":1395779403000},"page":"389-417","source":"Crossref","is-referenced-by-count":49,"title":["Fast First-Order Methods for Composite Convex Optimization with Backtracking"],"prefix":"10.1007","volume":"14","author":[{"given":"Katya","family":"Scheinberg","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Donald","family":"Goldfarb","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xi","family":"Bai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,3,26]]},"reference":[{"key":"9189_CR1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"A. Beck and M. Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems, SIAM J. Imaging Sciences, 2 (2009), pp. 183\u2013202.","journal-title":"SIAM J. Imaging Sci."},{"key":"9189_CR2","unstructured":"E. van den Berg, M. P. Friedlander, G. Hennenfent, F. Herrmann, R. Saab and \u00d6. Y\u0131lmaz, Sparco: a testing framework for sparse reconstruction, Tech. Report TR-2007-20, Dept. Computer Science, University of British Columbia, Vancouver, Oct 2007."},{"key":"9189_CR3","doi-asserted-by":"crossref","unstructured":"S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, Distributed optimization and statis- tical learning via the alternating direction method of multipliers, Foundations and Trends in Machine Learning, 3 (2011), pp. 1\u2013122.","DOI":"10.1561\/2200000016"},{"key":"9189_CR4","first-page":"1433","volume":"3","author":"E Cand\u00e8s","year":"2006","unstructured":"E. Cand\u00e8s, Compressive sampling, Proc. International Congress of Mathematics, 3 (2006), pp. 1433\u20131452.","journal-title":"Proc. Int. Congr. Math."},{"key":"9189_CR5","unstructured":"M. A. T. Figueiredo, R. D. Nowak, and S. J. Wright, Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems, IEEE J. Sel. Top. Signal Process, 1 (2007)."},{"key":"9189_CR6","unstructured":"A. Frank and A. Asuncion, UCI machine learning repository, 2010."},{"key":"9189_CR7","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10107-012-0530-2","volume":"141","author":"D Goldfarb","year":"2013","unstructured":"D. Goldfarb, S. Ma, and K. Scheinberg, Fast alternating linearization methods for minimizing the sum of two convex functions, Math. Prog. (2013) 141, 349-382.","journal-title":"Math. Prog."},{"key":"9189_CR8","unstructured":"A. Nemirovski and D. Yudin, Informational complexity and efficient methods for solution of convex extremal problems, Wiley, New York, 1983."},{"key":"9189_CR9","unstructured":"Y. E. Nesterov, Gradient methods for minimizing composite objective function. http:\/\/rwww.optimization-online.org ."},{"key":"9189_CR10","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Y. E. Nesterov, A method for unconstrained convex minimization problem with the rate of convergence $${\\cal O}(1\/k^{2})$$ O ( 1 \/ k 2 ) , Dokl. Akad. Nauk SSSR, 269 (1983), pp. 543\u2013547.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"9189_CR11","doi-asserted-by":"crossref","unstructured":"Y. E. Nesterov, Introductory lectures on convex optimization: a basic course, vol. 87, Springer, 2004, pp. xviii+236.","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"9189_CR12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"YE Nesterov","year":"2005","unstructured":"Y. E. Nesterov, Smooth minimization for non-smooth functions, Math. Program. Ser. A, 103 (2005), pp. 127\u2013152.","journal-title":"Math. Prog. Ser. A"},{"key":"9189_CR13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"R. Tibshirani, Regression shrinkage and selection via the lasso, Journal Royal Statistical Society B, 58 (1996), pp. 267\u2013288.","journal-title":"J. R. Stat. Soc. B"},{"key":"9189_CR14","unstructured":"P. Tseng, On accelerated proximal gradient methods for convex\u2013concave optimization. submitted to, SIAM J. Optim. (2008)."},{"key":"9189_CR15","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"M. Yuan and Y. Lin, Model selection and estimation in regression with grouped variables, Journal of the Royal Statistical Society: Series B (Statistical Methodology), 68 (2006), pp. 49\u201367.","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"key":"9189_CR16","unstructured":"Y. Zhang, Yall1: Your algorithms for $$\\ell _1$$ \u2113 1 . http:\/\/www.caam.rice.edu\/optimization\/L1\/YALL1\/ (2009)."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-014-9189-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-014-9189-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-014-9189-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T10:40:48Z","timestamp":1716633648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-014-9189-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,26]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["9189"],"URL":"https:\/\/doi.org\/10.1007\/s10208-014-9189-9","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,26]]}}}