{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T03:29:41Z","timestamp":1784518181024,"version":"3.55.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,9,6]],"date-time":"2012-09-06T00:00:00Z","timestamp":1346889600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10107-012-0588-x","type":"journal-article","created":{"date-parts":[[2012,9,5]],"date-time":"2012-09-05T05:50:09Z","timestamp":1346824209000},"page":"115-139","source":"Crossref","is-referenced-by-count":49,"title":["Iteration-complexity of first-order penalty methods for convex programming"],"prefix":"10.1007","volume":"138","author":[{"given":"Guanghui","family":"Lan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renato D. C.","family":"Monteiro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,9,6]]},"reference":[{"key":"588_CR1","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16, 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"588_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-008-0261-6","volume":"126","author":"G Lan","year":"2011","unstructured":"Lan, G., Lu, Z., Monteiro, R.D.C.: Primal\u2013dual first-order methods with $$\\cal O(1\/\\epsilon )$$ iteration-complexity for cone programming. Math. Program. 126, 1\u201329 (2011)","journal-title":"Math. Program."},{"key":"588_CR3","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: Complexity of variants of tsengs modified f-b splitting and korpelevichs methods for hemi-variational inequalities with applications to saddle-point and convex optimization problems. Manuscript, School of ISyE, Georgia Tech, Atlanta, June (2010)"},{"key":"588_CR4","doi-asserted-by":"crossref","first-page":"2755","DOI":"10.1137\/090753127","volume":"20","author":"RDC Monteiro","year":"2010","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: On the complexity of the hybrid proximal projection method for the iterates and the ergodic mean. SIAM J. Optim. 20, 2755\u20132787 (2010)","journal-title":"SIAM J. Optim."},{"key":"588_CR5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2005","unstructured":"Nemirovski, A.: Prox-method with rate of convergence $$o(1\/t)$$ for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15, 229\u2013251 (2005)","journal-title":"SIAM J. Optim."},{"key":"588_CR6","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)$$ . Doklady AN SSSR 269, 543\u2013547 (1983)","journal-title":"Doklady AN SSSR"},{"key":"588_CR7","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, Massachusetts (2004)"},{"key":"588_CR8","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":"588_CR9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10107-006-0034-z","volume":"109","author":"YE Nesterov","year":"2007","unstructured":"Nesterov, Y.E.: Dual extrapolation and its applications to solving variational inequalities and related problems. Math. Program. 109, 319\u2013344 (2007)","journal-title":"Math. Program."},{"key":"588_CR10","unstructured":"Tseng, P.: On Accelerated Proximal Gradient Methods for Convex-Concave Optimization. Manuscript, University of Washington, Seattle, May (2008)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0588-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0588-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0588-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:00:00Z","timestamp":1559124000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0588-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,6]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["588"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0588-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,6]]}}}