{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:31Z","timestamp":1740122671579,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T00:00:00Z","timestamp":1473897600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T00:00:00Z","timestamp":1473897600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IPF 16-4829"],"award-info":[{"award-number":["IPF 16-4829"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10589-016-9873-6","type":"journal-article","created":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T09:36:03Z","timestamp":1473932163000},"page":"425-451","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Adaptive smoothing algorithms for nonsmooth composite convex minimization"],"prefix":"10.1007","volume":"66","author":[{"given":"Quoc","family":"Tran-Dinh","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,15]]},"reference":[{"key":"9873_CR1","first-page":"53","volume-title":"Regularization, Optimization, Kernels, and Support Vector Machines","author":"A Andreas","year":"2014","unstructured":"Andreas, A., Marco, S., Suykens, J.: Hybrid conditional gradient-smoothing algorithms with applications to sparse and low rank regularization. In: Andreas, A., Marco, S., Suykens, J. (eds.) Regularization, Optimization, Kernels, and Support Vector Machines, pp. 53\u201382. CRC Press, Boca Raton (2014)"},{"key":"9873_CR2","unstructured":"Baes, M., and B\u00fcrgisser, M.: Smoothing techniques for solving semi-definite programs with many constraints. Optimization Online (2009)"},{"key":"9873_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operators Theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.: Convex Analysis and Monotone Operators Theory in Hilbert Spaces. Springer, New York (2011)"},{"issue":"1","key":"9873_CR4","doi-asserted-by":"publisher","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":"9873_CR5","doi-asserted-by":"publisher","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."},{"issue":"1","key":"9873_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/090756855","volume":"4","author":"S Becker","year":"2011","unstructured":"Becker, S., Bobin, J., Cand\u00e8s, E.J.: NESTA: a fast and accurate first-order method for sparse recovery. SIAM J. Imaging Sci. 4(1), 1\u201339 (2011)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"9873_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12532-011-0029-5","volume":"3","author":"S Becker","year":"2011","unstructured":"Becker, S., Cand\u00e8s, E.J., Grant, M.: Templates for convex cone problems with applications to sparse signal recovery. Math. Prog. Comput. 3(3), 165\u2013218 (2011)","journal-title":"Math. Prog. Comput."},{"issue":"4","key":"9873_CR8","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1093\/biomet\/asr043","volume":"94","author":"A Belloni","year":"2011","unstructured":"Belloni, A., Chernozhukov, V., Wang, L.: Square-root LASSO: pivotal recovery of sparse signals via conic programming. Biometrika 94(4), 791\u2013806 (2011)","journal-title":"Biometrika"},{"key":"9873_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., and Nemirovski, A.: Lectures on modern convex optimization: Analysis, algorithms, and engineering applications, volume\u00a03 of MPS\/SIAM Series on Optimization. SIAM (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"9873_CR10","volume-title":"Parallel and Distributed Computation: Numerical methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical methods. Prentice Hall, Englewood Cliffs (1989)"},{"issue":"1","key":"9873_CR11","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/s11750-014-0326-z","volume":"23","author":"R Bo\u0163","year":"2012","unstructured":"Bo\u0163, R., Hendrich, C.: A variable smoothing algorithm for solving convex optimization problems. TOP 23(1), 124\u2013150 (2012)","journal-title":"TOP"},{"issue":"2","key":"9873_CR12","doi-asserted-by":"publisher","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":"9873_CR13","doi-asserted-by":"publisher","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":"2","key":"9873_CR14","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/110854400","volume":"24","author":"J Chen","year":"2014","unstructured":"Chen, J., Burer, S.: A first-order smoothing technique for a class of large-scale linear programs. SIAM J. Optim. 24(2), 598\u2013620 (2014)","journal-title":"SIAM J. Optim."},{"key":"9873_CR15","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-1-4419-9569-8_10","volume-title":"Fixed-Point Algorithms for Inverse Problems in Science and Engineering, Chapter Proximal Splitting Methods in Signal Processing","author":"P Combettes","year":"2011","unstructured":"Combettes, P., Pesquet, J.-C.: Fixed-Point Algorithms for Inverse Problems in Science and Engineering, Chapter Proximal Splitting Methods in Signal Processing, pp. 185\u2013212. Springer, New York (2011)"},{"issue":"2","key":"9873_CR16","doi-asserted-by":"publisher","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":"1","key":"9873_CR17","first-page":"349","volume":"141","author":"D Goldfarb","year":"2012","unstructured":"Goldfarb, D., Ma, S.: Fast alternating linearization methods of minimization of the sum of two convex functions. Math. Prog. A 141(1), 349\u2013382 (2012)","journal-title":"Math. Prog. A"},{"key":"9873_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/0-387-30528-9_7","volume-title":"Global Optimization: From Theory to Implementation, Nonconvex Optimization and Its Applications","author":"M Grant","year":"2006","unstructured":"Grant, M., Boyd, S., Ye, Y.: Disciplined convex programming. In: Liberti, L., Maculan, N. (eds.) Global Optimization: From Theory to Implementation, Nonconvex Optimization and Its Applications, pp. 155\u2013210. Springer, New York (2006)"},{"issue":"11","key":"9873_CR19","doi-asserted-by":"publisher","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":"9873_CR20","doi-asserted-by":"publisher","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":"9873_CR21","unstructured":"Nesterov, Y.: A method for unconstrained convex minimization problem with the rate of convergence $$o(1\/k^2)$$. Doklady AN SSSR 269 (Soviet Math. Dokl.), 543\u2013547 (1983)"},{"key":"9873_CR22","series-title":"Applied Optimization","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. Applied Optimization, vol. 87. Kluwer Academic Publishers, Dordrecht (2004)"},{"issue":"1","key":"9873_CR23","doi-asserted-by":"publisher","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":"9873_CR24","doi-asserted-by":"publisher","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. Prog. 103(1), 127\u2013152 (2005)","journal-title":"Math. Prog."},{"issue":"2","key":"9873_CR25","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-006-0001-8","volume":"110","author":"Y Nesterov","year":"2007","unstructured":"Nesterov, Y.: Smoothing technique and its applications in semidefinite optimization. Math. Prog. 110(2), 245\u2013259 (2007)","journal-title":"Math. Prog."},{"issue":"1","key":"9873_CR26","doi-asserted-by":"publisher","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. Prog. 140(1), 125\u2013161 (2013)","journal-title":"Math. Prog."},{"key":"9873_CR27","unstructured":"Orabona, F., Argyriou, A., and Srebro, N.: PRISMA: proximal iterative smoothing algorithm. Tech. Report., pp. 1\u201321 (2012). \n                    http:\/\/arxiv.org\/abs\/1206.2372"},{"issue":"3","key":"9873_CR28","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":"9873_CR29","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-45610-7_2","volume-title":"Convexity and Duality in Optimization","author":"RT Rockafellar","year":"1985","unstructured":"Rockafellar, R.T.: Monotropic programming: a generalization of linear programming and network programming. In: Rockafellar, R.T. (ed.) Convexity and Duality in Optimization, pp. 10\u201336. Springer, New York (1985)"},{"key":"9873_CR30","unstructured":"Tran-Dinh, Q.: Sequential Convex Programming and Decomposition Approaches for Nonlinear Optimization. PhD Thesis, Arenberg Doctoral School, KU Leuven, Department of Electrical Engineering (ESAT\/SCD) and Optimization in Engineering Center, Kasteelpark Arenberg 10, 3001-Heverlee, Belgium (2012)"},{"key":"9873_CR31","unstructured":"Tran-Dinh, Q., Cevher, V.: A primal-dual algorithmic framework for constrained convex minimization, pp. 1\u201354. Tech. Report, LIONS (2014)"},{"key":"9873_CR32","first-page":"374","volume":"15","author":"Q Tran-Dinh","year":"2015","unstructured":"Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: Composite self-concordant minimization. J. Mach. Learn. Res. 15, 374\u2013416 (2015)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"9873_CR33","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10589-012-9515-6","volume":"55","author":"Q Tran-Dinh","year":"2013","unstructured":"Tran-Dinh, Q., Savorgnan, C., Diehl, M.: Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems. Compt. Optim. Appl. 55(1), 75\u2013111 (2013)","journal-title":"Compt. Optim. Appl."},{"issue":"1\u20132","key":"9873_CR34","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"Yang, J., Zhang, Y.: Alternating direction algorithms for $$\\ell _1$$ -problems in compressive sensing. SIAM J. Sci. Comput. 33(1\u20132), 250\u2013278 (2011)","journal-title":"SIAM J. Sci. Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9873-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9873-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9873-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T10:55:04Z","timestamp":1589712904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9873-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,15]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["9873"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9873-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2016,9,15]]},"assertion":[{"value":"24 August 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2016","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}