{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T19:58:42Z","timestamp":1775591922489,"version":"3.50.1"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T00:00:00Z","timestamp":1572480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T00:00:00Z","timestamp":1572480000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s12532-019-00173-3","type":"journal-article","created":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T18:11:44Z","timestamp":1572545504000},"page":"451-491","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An adaptive primal-dual framework for nonsmooth convex minimization"],"prefix":"10.1007","volume":"12","author":[{"given":"Quoc","family":"Tran-Dinh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmet","family":"Alacaoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Fercoq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volkan","family":"Cevher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,31]]},"reference":[{"key":"173_CR1","unstructured":"Arora, S., Khodak, M., Saunshi, N., Vodrahalli, K.: A compressed sensing view of unsupervised text embeddings, bag-of-$$n$$-grams, and LSTMs. In: International Conference on Learning Representations (2018)"},{"key":"173_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operators Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.: Convex Analysis and Monotone Operators Theory in Hilbert Spaces, 2nd edn. Springer, Berlin (2017)","edition":"2"},{"issue":"1","key":"173_CR3","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-thresholding agorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"173_CR4","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1137\/100818327","volume":"22","author":"A Beck","year":"2012","unstructured":"Beck, A., Teboulle, M.: Smoothing and first order methods: a unified framework. SIAM J. Optim. 22(2), 557\u2013580 (2012)","journal-title":"SIAM J. Optim."},{"key":"173_CR5","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"DP Bertsekas","year":"1996","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific, Belmont (1996)"},{"key":"173_CR6","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1613\/jair.1336","volume":"21","author":"A Borodin","year":"2004","unstructured":"Borodin, A., El-Yaniv, R., Gogan, V.: Can we learn to beat the best stock. J. Artif. Intell. Res. (JAIR) 21, 579\u2013594 (2004)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"173_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139087322","volume-title":"Convex Functions: Constructions, Characterizations and Counterexamples,","author":"JM Borwein","year":"2010","unstructured":"Borwein, J.M., Vanderwerff, J.D., et al.: Convex Functions: Constructions, Characterizations and Counterexamples, vol. 109. Cambridge University Press, Cambridge (2010)"},{"issue":"1","key":"173_CR8","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/s11750-014-0326-z","volume":"23","author":"RI Bo\u0163","year":"2012","unstructured":"Bo\u0163, R.I., Hendrich, C.: A variable smoothing algorithm for solving convex optimization problems. TOP 23(1), 124\u2013150 (2012)","journal-title":"TOP"},{"issue":"2","key":"173_CR9","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10589-012-9523-6","volume":"54","author":"RI Bot","year":"2013","unstructured":"Bot, R.I., Hendrich, C.: A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems. Comput. Optim. Appl. 54(2), 239\u2013262 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"173_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"issue":"30","key":"173_CR11","doi-asserted-by":"crossref","first-page":"12267","DOI":"10.1073\/pnas.0904287106","volume":"106","author":"J Brodie","year":"2009","unstructured":"Brodie, J., Daubechies, I., De Mol, C., Giannone, D., Loris, I.: Sparse and stable Markowitz portfolios. Proc. Natl. Acad. Sci. 106(30), 12267\u201312272 (2009)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"173_CR12","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E Candes","year":"2006","unstructured":"Candes, E., 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":"1","key":"173_CR13","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"issue":"1\u20132","key":"173_CR14","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10107-015-0957-3","volume":"159","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: On the ergodic convergence rates of a first-order primal-dual algorithm. Math. Program. 159(1\u20132), 253\u2013287 (2016)","journal-title":"Math. Program."},{"key":"173_CR15","first-page":"27:1","volume":"2","author":"C-C Chang","year":"2011","unstructured":"Chang, C.-C., Lin, C.-J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2, 27:1\u201327:27 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"3","key":"173_CR16","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(3), 538\u2013543 (1993)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"173_CR17","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10589-016-9864-7","volume":"66","author":"L Chen","year":"2017","unstructured":"Chen, L., Sun, D., Toh, K.-C.: A note on the convergence of ADMM for linearly constrained convex optimization problems. Comput. Optim. Appl. 66(2), 327\u2013343 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"173_CR18","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129\u2013159 (2001)","journal-title":"SIAM Rev."},{"key":"173_CR19","doi-asserted-by":"crossref","unstructured":"Combettes, P., Pesquet, J.-C.: Signal recovery by proximal forward\u2013backward splitting. In Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185\u2013212. Springer (2011)","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"173_CR20","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/s10957-012-0245-9","volume":"158","author":"L Condat","year":"2013","unstructured":"Condat, L.: A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms. J. Optim. Theory Appl. 158, 460\u2013479 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"173_CR21","doi-asserted-by":"crossref","first-page":"1760","DOI":"10.1137\/140992291","volume":"25","author":"D Davis","year":"2015","unstructured":"Davis, D.: Convergence rate analysis of the forward-Douglas\u2013Rachford splitting scheme. SIAM J. Optim. 25(3), 1760\u20131786 (2015)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"173_CR22","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1287\/moor.2016.0827","volume":"42","author":"D Davis","year":"2017","unstructured":"Davis, D., Yin, W.: Faster convergence rates of relaxed Peaceman\u2013Rachford and ADMM under regularity assumptions. Math. Oper. Res. 42(3), 577\u2013896 (2017)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"173_CR23","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/110826102","volume":"22","author":"O Devolder","year":"2012","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.: Double smoothing technique for large-scale linearly constrained convex optimization. SIAM J. Optim. 22(2), 702\u2013727 (2012)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"173_CR24","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"25","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 25(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"173_CR25","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1287\/moor.18.1.202","volume":"18","author":"J Eckstein","year":"1993","unstructured":"Eckstein, J.: Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming. Math. Oper. Res. 18(1), 202\u2013226 (1993)","journal-title":"Math. Oper. Res."},{"key":"173_CR26","doi-asserted-by":"crossref","unstructured":"Elhamifar, E., Vidal, R.: Sparse subspace clustering. In: IEEE Conference Computer Vision and Pattern Recognition (CVPR), pp. 2790\u20132797. IEEE (2009)","DOI":"10.1109\/CVPR.2009.5206547"},{"issue":"11","key":"173_CR27","doi-asserted-by":"crossref","first-page":"2765","DOI":"10.1109\/TPAMI.2013.57","volume":"35","author":"E Elhamifar","year":"2013","unstructured":"Elhamifar, E., Vidal, R.: Sparse subspace clustering: algorithm, theory, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 35(11), 2765\u20132781 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"173_CR28","unstructured":"Fercoq, O., Qu, Z.: Restarting accelerated gradient methods with a rough strong convexity estimate. pp. 1\u201323 (2016). Preprint: \narXiv:1609.07358"},{"issue":"1","key":"173_CR29","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"issue":"2","key":"173_CR30","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s40305-016-0131-5","volume":"5","author":"X Gao","year":"2017","unstructured":"Gao, X., Zhang, S.-Z.: First-order algorithms for convex optimization with nonseparable objective and coupled constraints. J. Oper. Res. Soc. China 5(2), 131\u2013159 (2017)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"6","key":"173_CR31","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/34.927464","volume":"23","author":"AS Georghiades","year":"2001","unstructured":"Georghiades, A.S., Belhumeur, P.N., Kriegman, D.J.: From few to many: illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Anal. Mach. Intell. 23(6), 643\u2013660 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"173_CR32","doi-asserted-by":"crossref","unstructured":"Giselsson, P., Boyd, S.: Monotonicity and restart in fast gradient methods. In: IEEE Conference on Decision and Control, CDC, pp. 5058\u20135063. Los Angeles, USA, December (2014)","DOI":"10.1109\/CDC.2014.7040179"},{"issue":"R\u20132","key":"173_CR33","first-page":"41","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marrocco, A.: Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9, d\u2019une classe de probl\u00e8mes de Dirichlet non lin\u00e9aires. Rev. Fran\u00e7aise Automat. Informat. Recherche Op\u00e9rationnelle, RAIRO Analyse Num\u00e9rique 9(R\u20132), 41\u201376 (1975)","journal-title":"Rev. Fran\u00e7aise Automat. Informat. Recherche Op\u00e9rationnelle, RAIRO Analyse Num\u00e9rique"},{"key":"173_CR34","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"BS He","year":"2012","unstructured":"He, B.S., Yuan, X.M.: On the $${O}(1\/n)$$ convergence rate of the Douglas\u2013Rachford alternating direction method. SIAM J. Numer. Anal. 50, 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"key":"173_CR35","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes, M.R.: Multiplier and gradient methods. J. Optim. Theory Appl. 4, 303\u2013320 (1969)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"173_CR36","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1137\/S0363012995281742","volume":"35","author":"KC Kiwiel","year":"1997","unstructured":"Kiwiel, K.C.: Proximal minimization methods with generalized Bregman functions. SIAM J. Control Optim. 35(4), 1142\u20131168 (1997)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"173_CR37","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10107-012-0588-x","volume":"138","author":"G Lan","year":"2013","unstructured":"Lan, G., Monteiro, R.D.C.: Iteration complexity of first-order penalty methods for convex programming. Math. Program. 138(1), 115\u2013139 (2013)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"173_CR38","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s10107-015-0861-x","volume":"155","author":"G Lan","year":"2016","unstructured":"Lan, G., Monteiro, R.D.C.: Iteration-complexity of first-order augmented Lagrangian methods for convex programming. Math. Program. 155(1\u20132), 511\u2013547 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"173_CR39","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/s10915-018-0893-5","volume":"39","author":"H Li","year":"2019","unstructured":"Li, H., Lin, Z.: Accelerated alternating direction method of multipliers: an optimal $$\\cal{O} (1\/k)$$ nonergodic analysis. J. Sci. Comput. 39(2), 671\u2013699 (2019)","journal-title":"J. Sci. Comput."},{"key":"173_CR40","unstructured":"Maas, A.L., Daly, R.E., Pham, P.T., Huang, D., Ng, A.Y., Potts, C.: Learning word vectors for sentiment analysis. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, pp. 142\u2013150. Association for Computational Linguistics (2011)"},{"issue":"1","key":"173_CR41","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1137\/110849468","volume":"23","author":"RDC Monteiro","year":"2013","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers. SIAM J. Optim. 23(1), 475\u2013507 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"173_CR42","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1137\/110849468","volume":"23","author":"RDC Monteiro","year":"2013","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: Iteration-complexity of block-decomposition algorithms and the alternating minimization augmented Lagrangian method. SIAM J. Optim. 23(1), 475\u2013507 (2013)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"173_CR43","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1080\/10556788.2017.1380642","volume":"34","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Patrascu, A., Glineur, F.: Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming. Optim. Methods Softw. 34(2), 305\u2013335 (2019)","journal-title":"Optim. Methods Softw."},{"issue":"11","key":"173_CR44","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1109\/TAC.2008.2007159","volume":"53","author":"I Necoara","year":"2008","unstructured":"Necoara, I., Suykens, J.A.K.: Applications of a smoothing technique to decomposition in convex optimization. IEEE Trans. Autom. Control 53(11), 2674\u20132679 (2008)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"5","key":"173_CR45","doi-asserted-by":"crossref","first-page":"3109","DOI":"10.1137\/120897547","volume":"52","author":"V Nedelcu","year":"2014","unstructured":"Nedelcu, V., Necoara, I., Tran-Dinh, Q.: Computational complexity of inexact gradient augmented Lagrangian methods: application to constrained MPC. SIAM J. Optim. Control 52(5), 3109\u20133134 (2014)","journal-title":"SIAM J. Optim. Control"},{"key":"173_CR46","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A Nemirovskii","year":"1983","unstructured":"Nemirovskii, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley, Hoboken (1983)"},{"issue":"1","key":"173_CR47","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1137\/S1052623403422285","volume":"16","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Excessive gap technique in nonsmooth convex minimization. SIAM J. Optim. 16(1), 235\u2013249 (2005)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"173_CR48","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 non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"173_CR49","unstructured":"Nguyen, V.Q., Fercoq, O., Cevher, V.: Smoothing technique for nonsmooth composite minimization with linear operator (2017). ArXiv preprint \narXiv:1706.05837"},{"key":"173_CR50","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019Donoghue","year":"2015","unstructured":"O\u2019Donoghue, B., Candes, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15, 715\u2013732 (2015)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"173_CR51","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1137\/14095697X","volume":"8","author":"Y Ouyang","year":"2015","unstructured":"Ouyang, Y., Chen, Y., Lan, G., Pasiliao, E.J.R.: An accelerated linearized alternating direction method of multiplier. SIAM J. Imaging Sci. 8(1), 644\u2013681 (2015)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"173_CR52","first-page":"123","volume":"1","author":"N Parikh","year":"2013","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 123\u2013231 (2013)","journal-title":"Found. Trends Optim."},{"key":"173_CR53","doi-asserted-by":"crossref","unstructured":"Pennington, J., Socher, R., Manning, C.: Glove: Global vectors for word representation. In: Proceedings of 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 1532\u20131543 (2014)","DOI":"10.3115\/v1\/D14-1162"},{"key":"173_CR54","unstructured":"Pourkamali-Anaraki, F., Becker, S.: Efficient Solvers for Sparse Subspace Clustering (2018). arXiv preprint \narXiv:1804.06291"},{"key":"173_CR55","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1, 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"173_CR56","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1137\/130910774","volume":"24","author":"R Shefi","year":"2014","unstructured":"Shefi, R., Teboulle, M.: Rate of convergence analysis of decomposition methods based on the proximal method of multipliers for convex minimization. SIAM J. Optim. 24(1), 269\u2013297 (2014)","journal-title":"SIAM J. Optim."},{"key":"173_CR57","unstructured":"Su, W., Boyd, S., Candes, E.: A differential equation for modeling Nesterov\u2019s accelerated gradient method: theory and insights. In: Advances in Neural Information Processing Systems (NIPS), pp. 2510\u20132518 (2014)"},{"issue":"1","key":"173_CR58","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-018-0033-z","volume":"72","author":"Q Tran-Dinh","year":"2019","unstructured":"Tran-Dinh, Q.: Proximal alternating penalty algorithms for constrained convex optimization. Comput. Optim. Appl. 72(1), 1\u201343 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"173_CR59","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/16M1093094","volume":"28","author":"Q Tran-Dinh","year":"2018","unstructured":"Tran-Dinh, Q., Fercoq, O., Cevher, V.: A smooth primal-dual optimization framework for nonsmooth composite convex minimization. SIAM J. Optim. 28(1), 96\u2013134 (2018)","journal-title":"SIAM J. Optim."},{"key":"173_CR60","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex\u2013concave optimization. Submitted to SIAM J. Optim, pp 1\u201320 (2008)"},{"issue":"3","key":"173_CR61","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/s10444-011-9254-8","volume":"38","author":"CB Vu","year":"2013","unstructured":"Vu, C.B.: A splitting algorithm for dual monotone inclusions involving co-coercive operators. Adv. Comput. Math. 38(3), 667\u2013681 (2013)","journal-title":"Adv. Comput. Math."},{"issue":"3","key":"173_CR62","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1198\/073500106000000251","volume":"25","author":"H Wang","year":"2007","unstructured":"Wang, H., Li, G., Jiang, G.: Robust regression shrinkage and consistent variable selection through the LAD-Lasso. J. Bus. Econ. Stat. 25(3), 347\u2013355 (2007)","journal-title":"J. Bus. Econ. Stat."},{"key":"173_CR63","unstructured":"White, L., Togneri, R., Liu, W., Bennamoun, M.: Generating bags of words from the sums of their word embeddings. In: 17th International Conference on Intelligent Text Processing and Computational Linguistics (CICLing) (2016)"},{"key":"173_CR64","unstructured":"Woodworth, B.E., Srebro, N.: Tight complexity bounds for optimizing composite objectives. In: Advances in Neural Information Processing Systems (NIPS), pp. 3639\u20133647 (2016)"},{"key":"173_CR65","doi-asserted-by":"crossref","unstructured":"Wright, S.J.: Optimization Algorithms for Data Analysis. IAS\/Park City Mathematics Series, pp. 1\u201349 (2017)","DOI":"10.1090\/pcms\/025\/02"},{"issue":"3","key":"173_CR66","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1137\/16M1082305","volume":"27","author":"Y Xu","year":"2017","unstructured":"Xu, Y.: Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming. SIAM J. Optim. 27(3), 1459\u20131484 (2017)","journal-title":"SIAM J. Optim."},{"key":"173_CR67","doi-asserted-by":"publisher","unstructured":"Xu, Y.: Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming. Math. Program. (2019). \nhttps:\/\/doi.org\/10.1007\/s10107-019-01425-9","DOI":"10.1007\/s10107-019-01425-9"},{"key":"173_CR68","unstructured":"Xu, Yi, Yan, Yan, Lin, Qihang, Yang, Tianbao: Homotopy smoothing for non-smooth problems with lower complexity than $${O}(1\/\\epsilon )$$. In: Advances in Neural Information Processing Systems, pp. 1208\u20131216 (2016)"},{"key":"173_CR69","unstructured":"Zhu, J., Rosset, S., Tibshirani, R., Hastie, T.J.: $$1$$-norm support vector machines. In: Advances in Neural Information Processing Systems (NIPS), pp. 49\u201356 (2004)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00173-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-019-00173-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00173-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:18:19Z","timestamp":1604017099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-019-00173-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,31]]},"references-count":69,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["173"],"URL":"https:\/\/doi.org\/10.1007\/s12532-019-00173-3","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,31]]},"assertion":[{"value":"21 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}