{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T01:33:50Z","timestamp":1780450430752,"version":"3.54.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T00:00:00Z","timestamp":1457654400000},"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":["Optim Lett"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s11590-016-1024-6","type":"journal-article","created":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T09:49:58Z","timestamp":1457689798000},"page":"609-626","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization"],"prefix":"10.1007","volume":"11","author":[{"given":"Andrei","family":"Patrascu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ion","family":"Necoara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quoc","family":"Tran-Dinh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,3,11]]},"reference":[{"key":"1024_CR1","unstructured":"Aybat, N., Iyengar, G.: An augmented Lagrangian method for conic convex programming, working paper. arXiv:1302.6322 (2013)"},{"key":"1024_CR2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1137\/100786721","volume":"22","author":"N Aybat","year":"2012","unstructured":"Aybat, N., Iyengar, G.: A first-order augmented Lagrangian method for compressed sensing. SIAM J Optim 22, 429\u2013459 (2012)","journal-title":"SIAM J Optim"},{"key":"1024_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex analysis and monotone operators theory in Hilbert spaces","author":"H Bauschke","year":"2011","unstructured":"Bauschke, H., Combettes, P.: Convex analysis and monotone operators theory in Hilbert spaces. Springer, Verlag (2011)"},{"key":"1024_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization: analysis, algorithms, and engineering applications, vol. 3, MPS\/SIAM series on optimization, SIAM (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"1024_CR5","unstructured":"Bertsekas, D.: Convex optimization theory. Athena Scientific (2009)"},{"key":"1024_CR6","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1137\/10081602X","volume":"21","author":"L Briceno-Arias","year":"2011","unstructured":"Briceno-Arias, L., Combettes, P.: A monotone + skew splitting model for composite monotone inclusions in duality. SIAM J Optim 21, 1230\u20131250 (2011)","journal-title":"SIAM J Optim"},{"key":"1024_CR7","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, 120\u2013145 (2011)","journal-title":"J Math Imaging Vis"},{"key":"1024_CR8","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1080\/02331930412331327157","volume":"53","author":"P Combettes","year":"2004","unstructured":"Combettes, P.: Solving monotone inclusions via compositions of nonexpansive averaged operators. Optimization 53, 475\u2013504 (2004)","journal-title":"Optimization"},{"key":"1024_CR9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10107-013-0677-5","volume":"146","author":"O Devolder","year":"2014","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.: First-order methods of smooth convex optimization with inexact oracle. Math Program 146, 37\u201375 (2014)","journal-title":"Math Program"},{"key":"1024_CR10","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math Program 55, 293\u2013318 (1992)","journal-title":"Math Program"},{"issue":"2","key":"1024_CR11","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/110822347","volume":"22","author":"B He","year":"2012","unstructured":"He, B., Tao, M., Yuan, X.: Alternating direction method with Gaussian back substitution for separable convex programming. SIAM J Optim 22(2), 313\u2013340 (2012)","journal-title":"SIAM J Optim"},{"issue":"1","key":"1024_CR12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0377-2217(03)00385-0","volume":"159","author":"B He","year":"2004","unstructured":"He, B., Yang, H., Zhang, C.: A modified augmented Lagrangian method for a class of monotone variational inequalities. Eur J Oper Res 159(1), 35\u201351 (2004)","journal-title":"Eur J Oper Res"},{"key":"1024_CR13","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: On the $${\\cal O}(1\/n)$$ O ( 1 \/ n ) convergence rate of the Douglas\u2013Rachford alternating direction method. SIAM J Num Anal 50, 700\u2013709 (2012)","journal-title":"SIAM J Num Anal"},{"key":"1024_CR14","doi-asserted-by":"publisher","unstructured":"Lan, G., Monteiro, R.: Iteration-complexity of first-order augmented Lagrangian methods for convex programming. Math Program 155(1\u20132), 511\u2013547 (2016). doi: 10.1007\/s10107-015-0861-x","DOI":"10.1007\/s10107-015-0861-x"},{"key":"1024_CR15","doi-asserted-by":"crossref","first-page":"1332","DOI":"10.1137\/14099509X","volume":"8","author":"X Li","year":"2015","unstructured":"Li, X., Yuan, X.: A proximal strictly contractive Peaceman\u2013Rachford splitting method for convex programming with applications to imaging. SIAM J Imaging Sci 8, 1332\u20131365 (2015)","journal-title":"SIAM J Imaging Sci"},{"issue":"5","key":"1024_CR16","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.1109\/TAC.2013.2294614","volume":"59","author":"I Necoara","year":"2014","unstructured":"Necoara, I., Nedelcu, V.: Rate analysis of inexact dual first order methods: application to dual decomposition. IEEE Trans Automa Control 59(5), 1232\u20131243 (2014)","journal-title":"IEEE Trans Automa Control"},{"key":"1024_CR17","unstructured":"Necoara, I., Patrascu, A.: Iteration complexity analysis of dual first order methods for conic convex programming, technical report. Opt Met Soft. arXiv:1409.1462 (2014)"},{"key":"1024_CR18","doi-asserted-by":"crossref","unstructured":"Necoara, I., Patrascu, A., Glineur, F.: Complexity certifications of first order inexact Lagrangian and penalty methods for conic convex programming, Tech. Rep., Univ. Politehnica Bucharest, pp. 1\u201334 (2015)","DOI":"10.1080\/10556788.2017.1380642"},{"issue":"11","key":"1024_CR19","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(11), 2674\u20132679 (2008)","journal-title":"IEEE Trans Autom Control"},{"issue":"5","key":"1024_CR20","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 Control Optim 52(5), 3109\u20133134 (2014)","journal-title":"SIAM J Control Optim"},{"issue":"4","key":"1024_CR21","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(4), 1757\u20131780 (2009)","journal-title":"SIAM J Optim"},{"key":"1024_CR22","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovskii","year":"2004","unstructured":"Nemirovskii, A.: Prox-method with rate of convergence $${\\cal O}(1\/t)$$ O ( 1 \/ t ) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J Optim 15, 229\u2013251 (2004)","journal-title":"SIAM J Optim"},{"key":"1024_CR23","unstructured":"Nesterov, Y.: New primal-dual subgradient methods for convex problems with functional constraints. http:\/\/lear.inrialpes.fr\/workshop\/osl2015\/slides\/osl2015_yurii.pdf (2015)"},{"key":"1024_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, Boston (2004)"},{"issue":"1","key":"1024_CR25","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"},{"key":"1024_CR26","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10107-013-0686-4","volume":"146","author":"Y Nesterov","year":"2014","unstructured":"Nesterov, Y.: Subgradient methods for huge-scale optimization problems. Math Program 146, 275\u2013297 (2014)","journal-title":"Math Program"},{"key":"1024_CR27","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"},{"key":"1024_CR28","doi-asserted-by":"crossref","unstructured":"Tran-Dinh, Q., Cevher, V.: A primal-dual algorithmic framework for constrained convex minimization, technical report. arXiv:1406.5403 (2014)","DOI":"10.1137\/130944539"},{"key":"1024_CR29","doi-asserted-by":"crossref","unstructured":"Tran-Dinh, Q., Necoara, I., Diehl, M.: Fast inexact distributed optimization algorithms for separable convex optimization. Optimization 65(2), 325\u2013356 (2016)","DOI":"10.1080\/02331934.2015.1044898"},{"issue":"1","key":"1024_CR30","doi-asserted-by":"crossref","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. Comput Optim Appl 55(1), 75\u2013111 (2013)","journal-title":"Comput Optim Appl"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1024-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1024-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1024-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1024-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,14]],"date-time":"2022-06-14T23:44:41Z","timestamp":1655250281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1024-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,11]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["1024"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1024-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,11]]}}}