{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T20:51:47Z","timestamp":1680468707232},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T00:00:00Z","timestamp":1371859200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s10898-013-0085-7","type":"journal-article","created":{"date-parts":[[2013,6,21]],"date-time":"2013-06-21T10:33:59Z","timestamp":1371810839000},"page":"59-80","source":"Crossref","is-referenced-by-count":8,"title":["Path-following gradient-based decomposition algorithms for separable convex optimization"],"prefix":"10.1007","volume":"59","author":[{"given":"Quoc","family":"Tran Dinh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ion","family":"Necoara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moritz","family":"Diehl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"key":"85_CR1","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D Bertsekas","year":"1989","unstructured":"Bertsekas, D., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice Hall, Englewood Cliffs (1989)"},{"issue":"1","key":"85_CR2","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."},{"key":"85_CR3","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":"85_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"3","key":"85_CR5","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TAC.2011.2161027","volume":"57","author":"J Duchi","year":"2012","unstructured":"Duchi, J., Agarwal, A., Wainwright, M.: Dual averaging for distributed optimization: convergence analysis and network scaling. IEEE Trans. Autom. Control 57(3), 592\u2013606 (2012)","journal-title":"IEEE Trans. Autom. Control"},{"key":"85_CR6","doi-asserted-by":"crossref","unstructured":"Fraikin, C., Nesterov, Y., Dooren, P.V.: Correlation between two projected matrices under isometry constraints. CORE Discussion Paper 2005\/80, UCL (2005)","DOI":"10.2139\/ssrn.885501"},{"key":"85_CR7","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1016\/j.amc.2003.11.040","volume":"160","author":"A Hamdi","year":"2005","unstructured":"Hamdi, A.: Two-level primal-dual proximal decomposition technique to solve large-scale optimization problems. Appl. Math. Comput. 160, 921\u2013938 (2005)","journal-title":"Appl. Math. Comput."},{"key":"85_CR8","doi-asserted-by":"crossref","unstructured":"Hamdi, A., Mishra, S.: Decomposition methods based on augmented Lagrangians: a survey. In: Mishra S.K. (ed.) Topics in Nonconvex Optimization: Theory and Application, pp. 175\u2013203. Springer-Verlag (2011)","DOI":"10.1007\/978-1-4419-9640-4_11"},{"key":"85_CR9","unstructured":"Kojima, M., Megiddo, N., Mizuno, S.: Horizontal and vertical decomposition in interior point methods for linear programs. Technical report, Information Sciences, Tokyo Institute of Technology, Tokyo (1993)"},{"key":"85_CR10","unstructured":"Lenoir, A., Mahey, P.: Accelerating convergence of a separable augmented Lagrangian algorithm. Technical report, LIMOS\/RR-07-14, 1\u201334 (2007)."},{"issue":"11","key":"85_CR11","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.: 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":"3","key":"85_CR12","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."},{"key":"85_CR13","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TAC.2008.2009515","volume":"54","author":"A Ned\u00edc","year":"2009","unstructured":"Ned\u00edc, A., Ozdaglar, A.: Distributed subgradient methods for multi-agent optimization. IEEE Trans. Autom. Control 54, 48\u201361 (2009)","journal-title":"IEEE Trans. Autom. Control"},{"key":"85_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course, Applied Optimization","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)"},{"key":"85_CR15","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. Society for Industrial Mathematics, Philadelphia (1994)"},{"key":"85_CR16","unstructured":"Nesterov, Y., Protasov, V.: Optimizing the spectral radius. CORE Discussion Paper pp. 1\u201316 (2011)"},{"issue":"8","key":"85_CR17","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1109\/JSAC.2006.879350","volume":"24","author":"D Palomar","year":"2006","unstructured":"Palomar, D., Chiang, M.: A tutorial on decomposition methods for network utility maximization. IEEE J. Sel. Areas Commun. 24(8), 1439\u20131451 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"85_CR18","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.20.3.634","volume":"20","author":"A Ruszczy\u0144ski","year":"1995","unstructured":"Ruszczy\u0144ski, A.: On convergence of an augmented lagrangian decomposition method for sparse convex optimization. Math. Oper. Res. 20, 634\u2013656 (1995)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"85_CR19","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1137\/11085311X","volume":"23","author":"Q Tran-Dinh","year":"2013","unstructured":"Tran-Dinh, Q., Necoara, I., Savorgnan, C., Diehl, M.: An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization. SIAM J. Optim. 23(1), 95\u2013125 (2013)","journal-title":"SIAM J. Optim."},{"key":"85_CR20","unstructured":"Tran-Dinh, Q., 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 (2012)"},{"issue":"7","key":"85_CR21","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1109\/TCOMM.2004.831346","volume":"52","author":"L Xiao","year":"2004","unstructured":"Xiao, L., Johansson, M., Boyd, S.: Simultaneous routing and resource allocation via dual decomposition. IEEE Trans. Commun. 52(7), 1136\u20131144 (2004)","journal-title":"IEEE Trans. Commun."},{"key":"85_CR22","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. Progam. 102, 1\u201324 (2005)","journal-title":"Math. Progam."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0085-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-013-0085-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0085-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T21:33:19Z","timestamp":1563226399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-013-0085-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["85"],"URL":"https:\/\/doi.org\/10.1007\/s10898-013-0085-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,22]]}}}