{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:25:24Z","timestamp":1752981924136},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T00:00:00Z","timestamp":1559606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T00:00:00Z","timestamp":1559606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s12532-019-00163-5","type":"journal-article","created":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T11:20:10Z","timestamp":1559647210000},"page":"1-38","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A hybrid quasi-Newton projected-gradient method with application to Lasso and basis-pursuit denoising"],"prefix":"10.1007","volume":"12","author":[{"given":"Ewout","family":"van den Berg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,4]]},"reference":[{"issue":"1","key":"163_CR1","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 (Methodol.) 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"issue":"2","key":"163_CR2","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"E van den Berg","year":"2008","unstructured":"van den Berg, E., Friedlander, M.P.: Probing the Pareto frontier for basis-pursuit solutions. SIAM J. Sci. Comput. 31(2), 890\u2013912 (2008)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"163_CR3","doi-asserted-by":"publisher","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":"2","key":"163_CR4","doi-asserted-by":"publisher","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. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"163_CR5","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"163_CR6","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10(4), 1196\u20131211 (2000)","journal-title":"SIAM J. Optim."},{"issue":"1\u20133","key":"163_CR7","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. Ser. B 45(1\u20133), 503\u2013528 (1989)","journal-title":"Math. Program. Ser. B"},{"issue":"2","key":"163_CR8","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TAC.1976.1101194","volume":"AC\u201321","author":"DP Bertsekas","year":"1976","unstructured":"Bertsekas, D.P.: On the Goldstein\u2013Levitin\u2013Polyak gradient projection method. IEEE Trans. Autom. Control AC\u201321(2), 174\u2013184 (1976)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"163_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"163_CR10","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10107-011-0479-6","volume":"135","author":"R Fletcher","year":"2012","unstructured":"Fletcher, R.: A limited memory steepest descent method. Math. Program. Ser. A 135, 413\u2013436 (2012)","journal-title":"Math. Program. Ser. A"},{"key":"163_CR11","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, Berlin (2006)","edition":"2"},{"key":"163_CR12","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"2003","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (2003)","edition":"2"},{"key":"163_CR13","volume-title":"Convex Polytopes, Volume 221 of Graduate Texts in Mathematics","author":"B Gr\u00fcnbaum","year":"2003","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes, Volume 221 of Graduate Texts in Mathematics, 2nd edn. Springer, Berlin (2003)","edition":"2"},{"key":"163_CR14","unstructured":"van\u00a0den Berg, E.: A hybrid quasi-Newton projected-gradient method with application to Lasso and basis-pursuit denoise. arXiv:1611.05483 (2016)"},{"issue":"4","key":"163_CR15","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1137\/100785028","volume":"21","author":"E van den Berg","year":"2011","unstructured":"van den Berg, E., Friedlander, M.P.: Sparse optimization with least-squares constraints. SIAM J. Optim. 21(4), 1201\u20131229 (2011)","journal-title":"SIAM J. Optim."},{"key":"163_CR16","doi-asserted-by":"crossref","unstructured":"Duchi, J., Shalev-Shwartz, S., Singer, Y., Chandra, T.: Efficient projections onto the $$\\ell _1$$-ball for learning in high dimensions. In: Proceedings of the 25th International Conference on Machine Learning, pp. 272\u2013279 (2008)","DOI":"10.1145\/1390156.1390191"},{"key":"163_CR17","doi-asserted-by":"publisher","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"JJ Moreau","year":"1965","unstructured":"Moreau, J.J.: Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France 93, 273\u2013299 (1965)","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France"},{"issue":"4","key":"163_CR18","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward\u2013backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"issue":"4","key":"163_CR19","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s12532-014-0071-1","volume":"6","author":"HJ Ferreau","year":"2014","unstructured":"Ferreau, H.J., Kirches, C., Potschka, A., Bock, H.G., Diehl, M.: qpOASES: a parametric active-set algorithm for quadratic programming. Math. Program. Comput. 6(4), 327\u2013363 (2014)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"163_CR20","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1137\/130921428","volume":"24","author":"JD Lee","year":"2014","unstructured":"Lee, J.D., Sun, Y., Saunders, M.A.: Proximal newton-type methods for minimizing composite functions. SIAM J. Optim. 24(3), 1420\u20131443 (2014)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"163_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462173.1462178","volume":"35","author":"E van den Berg","year":"2009","unstructured":"van den Berg, E., Friedlander, M.P., Hennenfent, G., Herrmann, F.J., Saab, R., Y\u0131lmaz, \u00d6.: Algorithm 890: sparco\u2014a testing framework for sparse reconstruction. ACM Trans. Math. Softw. 35(4), 1\u201316 (2009)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"163_CR22","doi-asserted-by":"publisher","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. Inf. Theory 51(2), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"163_CR23","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.acha.2010.10.002","volume":"31","author":"E Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E., Eldar, Y.C., Needell, D., Randall, P.: Compressed sensing with coherent and redundant dictionaries. Appl. Comput. Harmonic Anal. 31(1), 59\u201373 (2011)","journal-title":"Appl. Comput. Harmonic Anal."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00163-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-019-00163-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00163-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T03:32:15Z","timestamp":1721359935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-019-00163-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,4]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["163"],"URL":"https:\/\/doi.org\/10.1007\/s12532-019-00163-5","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,4]]},"assertion":[{"value":"29 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}