{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:23:21Z","timestamp":1761578601927},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,3,2]],"date-time":"2016-03-02T00:00:00Z","timestamp":1456876800000},"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":[[2016,7]]},"DOI":"10.1007\/s10589-016-9826-0","type":"journal-article","created":{"date-parts":[[2016,3,2]],"date-time":"2016-03-02T01:32:12Z","timestamp":1456882332000},"page":"671-697","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints"],"prefix":"10.1007","volume":"64","author":[{"given":"Jueyou","family":"Li","sequence":"first","affiliation":[]},{"given":"Guo","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Zhaoyang","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Zhiyou","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,2]]},"reference":[{"key":"9826_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/090762294","volume":"21","author":"NS Aybat","year":"2011","unstructured":"Aybat, N.S., Iyengar, G.: A first-order smoothed penalty method for compressed sensing. SIAM J. Optim. 21, 287\u2013313 (2011)","journal-title":"SIAM J. Optim."},{"key":"9826_CR2","doi-asserted-by":"crossref","unstructured":"Aybat N.S., Wang Z.: A parallel method for large scale convex regression problems. In: 53rd IEEE Conference on Decision and Control, pp. 5710-5717. (2014). doi: 10.1109\/CDC.2014.7040283","DOI":"10.1109\/CDC.2014.7040283"},{"key":"9826_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 algorithm for linear inverse problems. SIAM J. Imaging Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"9826_CR4","doi-asserted-by":"crossref","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\u201339 (2011)","journal-title":"SIAM J. Imaging Sci."},{"key":"9826_CR5","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)"},{"key":"9826_CR6","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. Foundations and Trends $$@$$ @ in. Mach. Learn. 3, 1\u2013122 (2011)","journal-title":"Mach. Learn."},{"key":"9826_CR7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10589-013-9599-7","volume":"57","author":"XJ Cai","year":"2014","unstructured":"Cai, X.J., Gu, G.Y., He, B.S.: On the $$O(1\/t)$$ O ( 1 \/ t ) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators. Comput. Optim. Appl. 57, 339\u2013363 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"9826_CR8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01582566","volume":"64","author":"G Chen","year":"1994","unstructured":"Chen, G., Teboulle, M.: A proximal-based decomposition method for convex minimization problems. Math. Program. 64, 81\u2013101 (1994)","journal-title":"Math. Program."},{"key":"9826_CR9","volume-title":"Decomposition Techniques in Mathematical Programming: Engineering and Science Applications","author":"AJ Connejo","year":"2006","unstructured":"Connejo, A.J., M\u00ednguez, R., Castillo, E., Garc\u00eda-Bertrand, R.: Decomposition Techniques in Mathematical Programming: Engineering and Science Applications. Springer, Berlin (2006)"},{"key":"9826_CR10","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, 702\u2013727 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9826_CR11","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10589-012-9515-6","volume":"55","author":"QT Dinh","year":"2013","unstructured":"Dinh, Q.T., Savorgnan, C., Diehl, M.: Combining lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems. Comput. Optim. Appl. 55(1), 75\u2013111 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"9826_CR12","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10107-010-0430-2","volume":"133","author":"A Gilpin","year":"2012","unstructured":"Gilpin, A., Pena, J., Sandholm, T.: First-order algorithm with $$O(\\ln (1\/\\varepsilon ))$$ O ( ln ( 1 \/ \u03b5 ) ) convergence for $$\\varepsilon $$ \u03b5 -equilibrium. Math. Program. 133, 279\u2013298 (2012)","journal-title":"Math. Program."},{"key":"9826_CR13","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1137\/090780705","volume":"22","author":"D Goldfarb","year":"2012","unstructured":"Goldfarb, D., Ma, S.: Fast multiple splitting algorithms for convex optimization. SIAM J. Optim. 22, 533\u2013556 (2012)","journal-title":"SIAM J. Optim."},{"key":"9826_CR14","author":"N He","year":"2015","unstructured":"He, N., Juditsky, A., Nemirovski, A.: Mirror Prox algorithm for multi-term composite minimization and semi-separable problems. Comput. Optim. Appl. (2015). doi: 10.1007\/s10589-014-9723-3","journal-title":"Comput. Optim. Appl."},{"key":"9826_CR15","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/110822347","volume":"22","author":"BS He","year":"2012","unstructured":"He, B.S., Tao, M., Yuan, X.M.: Alternating direction method with Gaussian back substitution for separable convex programming. SIAM J. Optim. 22, 313\u2013340 (2012)","journal-title":"SIAM J. Optim."},{"key":"9826_CR16","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1017\/S1446181114000273","volume":"56","author":"J Li","year":"2014","unstructured":"Li, J., Wu, C., Wu, Z., Long, Q., Wang, X.: Distributed proximal-gradient method for convex optimization with inequality constraints. J. ANZIAM 56, 160\u2013178 (2014)","journal-title":"J. ANZIAM"},{"key":"9826_CR17","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10898-014-0174-2","volume":"61","author":"J Li","year":"2015","unstructured":"Li, J., Wu, C., Wu, Z., Long, Q.: Gradient-free method for nonsmooth distributed optimization. J. Global Optim. 61, 325\u2013340 (2015)","journal-title":"J. Global Optim."},{"key":"9826_CR18","author":"J Li","year":"2015","unstructured":"Li, J., Wu, Z., Wu, C., Long, Q., Wang, X.: An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints. J. Optim. Theory Appl. (2015). doi: 10.1007\/s10957-015-0757-1","journal-title":"J. Optim. Theory Appl."},{"key":"9826_CR19","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1109\/90.811451","volume":"7","author":"SH Low","year":"1999","unstructured":"Low, S.H., Lapsley, D.E.: Optimization flow control. I. Basic algorithm and convergence. IEEE\/ACM Trans. Netw. 7, 861\u2013874 (1999)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9826_CR20","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.: Application of a smoothing technique to decomposition in convex optimization. IEEE Trans. Autom. Control 53, 2674\u20132679 (2008)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"9826_CR21","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10957-009-9566-8","volume":"143","author":"I Necoara","year":"2009","unstructured":"Necoara, I., Suykens, J.: Interior-point lagrangian decomposition method for separable convex optimization. J. Optim. Theory Appl. 143(3), 567\u2013588 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"9826_CR22","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.jprocont.2010.12.010","volume":"21","author":"I Necoara","year":"2011","unstructured":"Necoara, I., Nedelcu, V., Dumitrache, I.: Parallel and distributed optimization methods for estimation and control in networks. J. Process Control 21(5), 756\u2013766 (2011)","journal-title":"J. Process Control"},{"key":"9826_CR23","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1137\/070708111","volume":"19","author":"A Nedic","year":"2009","unstructured":"Nedic, A., Ozdaglar, A.: Approximate primal solutions and rate analysis for dual subgradient methods. SIAM J. Optim. 19, 1757\u20131780 (2009)","journal-title":"SIAM J. Optim."},{"key":"9826_CR24","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 Academic Publishers, Boston (2004)"},{"key":"9826_CR25","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, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"9826_CR26","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.trc.2009.04.022","volume":"18","author":"LB Oliveira","year":"2010","unstructured":"Oliveira, L.B., Camponogara, E.: Multi-agent model predictive control of signaling split in urban traffic networks. Transp. Res. Part C 18, 120\u2013139 (2010)","journal-title":"Transp. Res. Part C"},{"issue":"1","key":"9826_CR27","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TAC.2013.2275667","volume":"59","author":"P Patrinos","year":"2014","unstructured":"Patrinos, P., Bemporad, A.: An accelerated dual gradient-projection algorithm for embedded linear model predictive control. IEEE Trans. Autom. Control 59(1), 18\u201333 (2014)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9826_CR28","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF02187650","volume":"64","author":"CH Rosa","year":"1996","unstructured":"Rosa, C.H., Ruszczy\u0144ski, A.: On augmented Lagrangian decomposition methods for multistage stochastic programs. Ann. Oper. Res. 64, 289\u2013309 (1996)","journal-title":"Ann. Oper. Res."},{"key":"9826_CR29","doi-asserted-by":"crossref","unstructured":"Samadi, P., Mohsenian-Rad, A., Schober, R., Wong, V.W.S., Jatskevich, J.: Optimal real-time pricing algorithm based on utility maximization for smart grid. In: Proceedings of IEEE International Conference on Smart Grid Communications, pp. 415\u2013420 (2010)","DOI":"10.1109\/SMARTGRID.2010.5622077"},{"key":"9826_CR30","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1109\/TSG.2012.2203341","volume":"3","author":"P Samadi","year":"2012","unstructured":"Samadi, P., Mohsenian-Rad, A., Schober, R., Wong, V.W.S.: Advanced demand side management for the future smart grid using mechanism design. IEEE Trans. Smart Grid 3, 1170\u20131180 (2012)","journal-title":"IEEE Trans. Smart Grid"},{"key":"9826_CR31","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. Department of Mathematics, University of Washington, Seattle, WA 98195, USA (2008)"},{"key":"9826_CR32","unstructured":"Wang, X., Hong, M., Ma, S., Luo, Z.: Solving multiple-block separable convex minimization problems using two-block alternating direction method of multipliers. http:\/\/arxiv.org\/pdf\/1308.5294v1 (2013)"},{"key":"9826_CR33","doi-asserted-by":"crossref","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$$ \u2113 1 -problems in compressive sensing. SIAM J. Sci. Comput. 33, 250\u2013278 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"9826_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-003-0471-x","volume":"102","author":"G Zhao","year":"2005","unstructured":"Zhao, G.: A Lagrangian dual method with self-concordant barriers for multistage stochastic convex programming. Math. Program. 102, 1\u201324 (2005)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9826-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9826-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9826-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T14:37:41Z","timestamp":1559227061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9826-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,2]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["9826"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9826-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,2]]}}}