{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T17:10:26Z","timestamp":1773335426920,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,1,24]],"date-time":"2015-01-24T00:00:00Z","timestamp":1422057600000},"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":["Math. Program."],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10107-015-0861-x","type":"journal-article","created":{"date-parts":[[2015,1,23]],"date-time":"2015-01-23T16:58:01Z","timestamp":1422032281000},"page":"511-547","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":65,"title":["Iteration-complexity of first-order augmented Lagrangian methods for convex programming"],"prefix":"10.1007","volume":"155","author":[{"given":"Guanghui","family":"Lan","sequence":"first","affiliation":[]},{"given":"Renato D. C.","family":"Monteiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,24]]},"reference":[{"key":"861_CR1","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"D Bertsekas","year":"1982","unstructured":"Bertsekas, D.: Constrained Optimization and Lagrange Multiplier Methods, 1st edn. Academic Press, New York (1982)","edition":"1"},{"key":"861_CR2","volume-title":"Nonlinear Programming","author":"D Bertsekas","year":"1984","unstructured":"Bertsekas, D.: Nonlinear Programming, 2nd edn. Athena Scientific, New York (1984)","edition":"2"},{"key":"861_CR3","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S Burer","year":"2003","unstructured":"Burer, S., Monteiro, R.D.C.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. Series B 95, 329\u2013357 (2003)","journal-title":"Math. Program. Series B"},{"key":"861_CR4","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-004-0564-1","volume":"103","author":"S Burer","year":"2005","unstructured":"Burer, S., Monteiro, R.D.C.: Local minima and convergence in low-rank semidefinite programming. Math. Program. 103, 427\u2013444 (2005)","journal-title":"Math. Program."},{"key":"861_CR5","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1137\/110848864","volume":"22","author":"S Ghadimi","year":"2012","unstructured":"Ghadimi, S., Lan, G.: Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, I: a generic algorithmic framework. SIAM J. Optim. 22, 1469\u20131492 (2012)","journal-title":"SIAM J. Optim."},{"key":"861_CR6","volume-title":"Modified Lagrangians and Monotone Maps in Optimization","author":"EG Golshtein","year":"1996","unstructured":"Golshtein, E.G., Tretyakov, N.V.: Modified Lagrangians and Monotone Maps in Optimization. Springer, New York (1996)"},{"key":"861_CR7","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. Appl. 4, 303\u2013320 (1969)","journal-title":"J. Optim. Appl."},{"key":"861_CR8","unstructured":"Jarre, F., Rendl, F.: An augmented primal-dual method for linear conic programs. Manuscript, Institut fur Mathematik, Universit at Dusseldorf, Germany, Austria, (2007)"},{"key":"861_CR9","unstructured":"Lan, G.: Convex optimization under inexact first-order information. Ph.D. Dissertation, School of Industrial Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA, (2009)"},{"key":"861_CR10","unstructured":"Lan, G.: Bundle-level type methods uniformly optimal for smooth andnon-smooth convex optimization. Manuscript, Department of Industrialand Systems Engineering, University of Florida, Gainesville, FL32611, USA, January 2013. Revision submitted to MathematicalProgramming"},{"key":"861_CR11","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, 115\u2013139 (2013)","journal-title":"Math. Program."},{"key":"861_CR12","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: Complexity of variants of tseng\u2019s modified f-b splitting and korpelevich\u2019s methods for hemi-variational inequalities with applications to saddle-point and convex optimization problems. Manuscript, School of ISyE, Georgia Tech, Atlanta, GA, 30332, USA, (2010)"},{"key":"861_CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: Prox-method with rate of convergence $$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":"861_CR14","unstructured":"Nemirovski, A.S., Yudin, D.: Problem complexity and method efficiency in optimization. Wiley-Interscience Series in Discrete Mathematics. John Wiley, XV, (1983)"},{"key":"861_CR15","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for unconstrained convex minimization problem with the rate of convergence $$O(1\/k^2)$$ O ( 1 \/ k 2 ) . Dokl. AN SSSR 269, 543\u2013547 (1983)","journal-title":"Dokl. AN SSSR"},{"key":"861_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"YE Nesterov","year":"2004","unstructured":"Nesterov, Y.E.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Massachusetts (2004)"},{"key":"861_CR17","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"YE Nesterov","year":"2005","unstructured":"Nesterov, Y.E.: Smooth minimization of nonsmooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"861_CR18","unstructured":"Nesterov, Y.E.: Gradient methods for minimizing composite objective functions. Technical report, Center for Operations Research and Econometrics (CORE), Catholic University of Louvain (2007)"},{"key":"861_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)"},{"key":"861_CR20","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1137\/S1052623497321894","volume":"12","author":"GD Pillo","year":"2002","unstructured":"Pillo, G.D., Lucidi, S.: An augmented lagrangian function with improved exactness properties. SIAM J. Optim. 12, 376\u2013406 (2002)","journal-title":"SIAM J. Optim."},{"key":"861_CR21","first-page":"283","volume-title":"Optimization","author":"MMD Powell","year":"1969","unstructured":"Powell, M.M.D.: An efficient method for nonlinear constraints in minimization problems. In: Fletcher, R. (ed.) Optimization, pp. 283\u2013298. Academic Press, London (1969)"},{"key":"861_CR22","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841059","volume-title":"Nonlinear Optimization","author":"A Ruszczynski","year":"2006","unstructured":"Ruszczynski, A.: Nonlinear Optimization, 1st edn. Princeton University Press, Princeton (2006)","edition":"1"},{"key":"861_CR23","unstructured":"Zhao, X., Sun, D., Toh, K.: A Newton-CG augmented Lagrangian method for semidefinite programming. Manuscript, National University of Singapore, Singapore (2008)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0861-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0861-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0861-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,29]],"date-time":"2020-08-29T08:03:58Z","timestamp":1598688238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0861-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,24]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["861"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0861-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,24]]}}}