{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T05:20:13Z","timestamp":1781846413655,"version":"3.54.5"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,9,6]],"date-time":"2014-09-06T00:00:00Z","timestamp":1409961600000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10589-014-9694-4","type":"journal-article","created":{"date-parts":[[2014,9,5]],"date-time":"2014-09-05T12:53:08Z","timestamp":1409921588000},"page":"633-674","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization"],"prefix":"10.1007","volume":"60","author":[{"given":"Qihang","family":"Lin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lin","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,9,6]]},"reference":[{"issue":"5","key":"9694_CR1","doi-asserted-by":"crossref","first-page":"2452","DOI":"10.1214\/12-AOS1032","volume":"40","author":"A Agarwal","year":"2012","unstructured":"Agarwal, A., Negahban, S.N., Wainwright, M.J.: Fast global convergence of gradient methods for high-dimensional statistical recovery. Ann. Stat. 40(5), 2452\u20132482 (2012)","journal-title":"Ann. Stat."},{"issue":"1","key":"9694_CR2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-threshold algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"9694_CR3","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1007\/s00041-008-9041-1","volume":"14","author":"K Bredies","year":"2008","unstructured":"Bredies, K., Lorenz, D.A.: Linear convergence of iterative soft-thresholding. J. Fourier Anal. Appl. 14, 813\u2013837 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"1","key":"9694_CR4","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1137\/060657704","volume":"51","author":"AM Bruckstein","year":"2009","unstructured":"Bruckstein, A.M., Donoho, D.L., Elad, M.: From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev. 51(1), 34\u201381 (2009)","journal-title":"SIAM Rev."},{"issue":"12","key":"9694_CR5","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inform. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"9694_CR6","doi-asserted-by":"crossref","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","volume":"52","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Tao, T.: Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inform. Theory 52(12), 5406\u20135425 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"9694_CR7","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ 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. Inform. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"9694_CR8","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(1), 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"9694_CR9","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inform. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9694_CR10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10107-012-0541-z","volume":"138","author":"CC Gonzaga","year":"2013","unstructured":"Gonzaga, C.C., Karas, E.W.: Fine tuning Nesterov\u2019s steepest descent algorithm for differentiable convex programming. Math. Program. Ser. A 138, 141\u2013166 (2013)","journal-title":"Math. Program. Ser. A"},{"key":"9694_CR11","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s11075-012-9668-5","volume":"64","author":"M Gu","year":"2013","unstructured":"Gu, M., Lim, L.-H., Wu, C.J.: ParNes: a rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals. Numer. Algorithms 64, 321\u2013347 (2013)","journal-title":"Numer. Algorithms"},{"issue":"3","key":"9694_CR12","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"ET Hale","year":"2008","unstructured":"Hale, E.T., Yin, W., Zhang, Y.: Fixed-point continuation for $$\\ell _1$$ \u2113 1 -minimization: methodology and convergence. SIAM J. Optim. 19(3), 1107\u20131130 (2008)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9694_CR13","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1016\/j.acha.2011.04.005","volume":"31","author":"S Li","year":"2011","unstructured":"Li, S., Mo, Q.: New bounds on the restricted isometry constant $$\\delta _{2k}$$ \u03b4 2 k . Appl. Comput. Harmon. Anal. 31(3), 460\u2013468 (2011)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"2","key":"9694_CR14","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1137\/0330025","volume":"30","author":"Z-Q Luo","year":"1992","unstructured":"Luo, Z.-Q., Tseng, P.: On the linear convergence of descent methods for convex essentially smooth minimization. SIAM J. Control Optim. 30(2), 408\u2013425 (1992)","journal-title":"SIAM J. Control Optim."},{"key":"9694_CR15","unstructured":"Monteiro, R.D.C., Ortiz, C., Svaiter, B.F.: An adaptive accelerated first-order method for convex optimization. Technical report, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA (2012)"},{"key":"9694_CR16","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A Nemirovski","year":"1983","unstructured":"Nemirovski, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)"},{"key":"9694_CR17","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. Kluwer, Boston (2004)"},{"issue":"1","key":"9694_CR18","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of nonsmooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"9694_CR19","first-page":"2","volume":"78","author":"Y Nesterov","year":"2008","unstructured":"Nesterov, Y.: How to advance in structural convex optimization. OPTIMA: Math. Program. Soc. Newsl. 78, 2\u20135 (2008)","journal-title":"OPTIMA: Math. Program. Soc. Newsl."},{"issue":"2007\/76","key":"9694_CR20","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective function. Math. Program. Ser. B 140(2007\/76), 125\u2013161 (2013)","journal-title":"Math. Program. Ser. B"},{"key":"9694_CR21","series-title":"SIAM Studies in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovski, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM Studies in Applied Mathematics. SIAM, Philadelphia (1994)"},{"key":"9694_CR22","doi-asserted-by":"crossref","unstructured":"O\u2019Donoghue, B., Cand\u00e8s, E.J.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. (2013). doi: 10.1007\/s10208-013-9150-3","DOI":"10.1007\/s10208-013-9150-3"},{"key":"9694_CR23","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"9694_CR24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R Stat. Soc. Ser. B 58, 267\u2013288 (1996)","journal-title":"J. R Stat. Soc. Ser. B"},{"key":"9694_CR25","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex\u2013concave optimization. Manuscript (2008)"},{"issue":"7","key":"9694_CR26","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowad, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"9694_CR27","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(1), 159\u2013186 (2012)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9694_CR28","doi-asserted-by":"crossref","first-page":"1832","DOI":"10.1137\/090747695","volume":"32","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Yin, W., Goldfarb, D., Zhang, Y.: A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization and continuation. SIAM J. Sci. Comput. 32(4), 1832\u20131857 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"9694_CR29","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1137\/120869997","volume":"23","author":"L Xiao","year":"2013","unstructured":"Xiao, L., Zhang, T.: A proximal-gradient homotopy method for the sparse least-squares problem. SIAM J. Optim. 23, 1062\u20131091 (2013)","journal-title":"SIAM J. Optim."},{"key":"9694_CR30","doi-asserted-by":"crossref","first-page":"1567","DOI":"10.1214\/07-AOS520","volume":"36","author":"C-H Zhang","year":"2008","unstructured":"Zhang, C.-H., Huang, J.: The sparsity and bias of the lasso selection in high-dimensional linear regression. Ann. Stat. 36, 1567\u20131594 (2008)","journal-title":"Ann. Stat."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9694-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-014-9694-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9694-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,2]],"date-time":"2024-06-02T07:33:11Z","timestamp":1717313591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-014-9694-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,6]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9694"],"URL":"https:\/\/doi.org\/10.1007\/s10589-014-9694-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,6]]}}}