{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T15:44:00Z","timestamp":1772293440509,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,2,6]],"date-time":"2009-02-06T00:00:00Z","timestamp":1233878400000},"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":[[2011,1]]},"DOI":"10.1007\/s10107-008-0261-6","type":"journal-article","created":{"date-parts":[[2009,2,5]],"date-time":"2009-02-05T15:45:33Z","timestamp":1233848733000},"page":"1-29","source":"Crossref","is-referenced-by-count":96,"title":["Primal-dual first-order methods with $${\\mathcal {O}(1\/\\epsilon)}$$ iteration-complexity for cone programming"],"prefix":"10.1007","volume":"126","author":[{"given":"Guanghui","family":"Lan","sequence":"first","affiliation":[]},{"given":"Zhaosong","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Renato D. C.","family":"Monteiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,2,6]]},"reference":[{"key":"261_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. Opt. 16, 697\u2013725 (2006)","journal-title":"SIAM J. Opt."},{"key":"261_CR2","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. Ser. B 95, 329\u2013357 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"261_CR3","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":"261_CR4","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1137\/060676386","volume":"19","author":"A. d\u2019Aspremont","year":"2008","unstructured":"d\u2019Aspremont A.: Smooth optimization with approximate gradient. SIAM J. Opt. 19, 1171\u20131183 (2008)","journal-title":"SIAM J. Opt."},{"key":"261_CR5","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex analysis and minimization algorithms I. Comprehensive Study in Mathematics, vol. 305. Springer, New York (1993)","DOI":"10.1007\/978-3-662-06409-2"},{"key":"261_CR6","unstructured":"Hoda, S., Gilpin, A., Pe\u00f1a, J.: A gradient-based approach for computing nash equilibria of large sequential games. Working Paper, Tepper School of Business, Carnegie Mellon University (2006)"},{"key":"261_CR7","first-page":"747","volume":"12","author":"G. Korpelevich","year":"1976","unstructured":"Korpelevich G.: The extragradient method for finding saddle points and other problems. Eknomika i Matematicheskie Metody 12, 747\u2013756 (1976)","journal-title":"Eknomika i Matematicheskie Metody"},{"key":"261_CR8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10107-006-0031-2","volume":"109","author":"Z. Lu","year":"2007","unstructured":"Lu Z., Nemirovski A., Monteiro R.D.C.: Large-scale semidefinite programming via saddle point mirror-prox algorithm. Math. Program. 109, 211\u2013237 (2007)","journal-title":"Math. Program."},{"key":"261_CR9","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. Opt. 15, 229\u2013251 (2005)","journal-title":"SIAM J. Opt."},{"key":"261_CR10","first-page":"543","volume":"269","author":"Y.E. 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) (translated as Sov. Math. Docl.)","journal-title":"Doklady AN SSSR"},{"key":"261_CR11","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y.E. Nesterov","year":"2005","unstructured":"Nesterov Y.E.: Smooth minimization of nonsmooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"261_CR12","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10107-006-0001-8","volume":"110","author":"Y.E. Nesterov","year":"2006","unstructured":"Nesterov Y.E.: Smoothing technique and its applications in semidefinite optimization. Math. Program. 110, 245\u2013259 (2006)","journal-title":"Math. Program."},{"key":"261_CR13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"R.H. T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc R.H., Toh K.C., Todd M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95, 189\u2013217 (2003)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0261-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-008-0261-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0261-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:06Z","timestamp":1559123406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-008-0261-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,6]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["261"],"URL":"https:\/\/doi.org\/10.1007\/s10107-008-0261-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,6]]}}}