{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:44:10Z","timestamp":1774946650763,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T00:00:00Z","timestamp":1164326400000},"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":[[2007,1,30]]},"DOI":"10.1007\/s10107-006-0031-2","type":"journal-article","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T16:00:14Z","timestamp":1164643214000},"page":"211-237","source":"Crossref","is-referenced-by-count":19,"title":["Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm"],"prefix":"10.1007","volume":"109","author":[{"given":"Zhaosong","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arkadi","family":"Nemirovski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato D. C.","family":"Monteiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,24]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s101070100279","volume":"93","author":"S. Burer","year":"2002","unstructured":"Burer S., Monteiro R.D.C., Zhang Y. (2002) Solving a class of semidefinite programs via nonlinear programming. Math. Program. 93, 97\u2013122","journal-title":"Math. Program."},{"key":"31_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. (2003) A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. Ser. B 95, 329\u2013357","journal-title":"Math. Program. Ser. B"},{"key":"31_CR3","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S1052623400366218","volume":"11","author":"M. Fukuda","year":"2000","unstructured":"Fukuda M., Kojima M., Murota K., Nakata K. (2000) Exploiting sparsity in semidefinite programming via matrix completion I: general framework. SIAM J Optim. 11, 647\u2013674","journal-title":"SIAM J Optim."},{"key":"31_CR4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","volume":"58","author":"B. Grone","year":"1984","unstructured":"Grone B., Johnson C.R., Marques de Sa E., Wolkowicz H. (1984) Positive definite completions of partial Hermitian matrices. Linear Algebr. Appl. 58, 109\u2013124","journal-title":"Linear Algebr. Appl."},{"key":"31_CR5","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C. Helmberg","year":"2000","unstructured":"Helmberg C., Rendl F. (2000) A spectral bundle method for semidefinite programming. SIAM J. Optim. 10, 673\u2013696","journal-title":"SIAM J. Optim."},{"key":"31_CR6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A. Nemirovski","year":"2004","unstructured":"Nemirovski A. (2004) Prox-method with rate of convergence O(1\/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex\u2013concave saddle point problems. SIAM J. Optim. 15, 229\u2013251","journal-title":"SIAM J. Optim."},{"key":"31_CR7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Yu. Nesterov","year":"2005","unstructured":"Nesterov Yu. (2005) Smooth minimization of non-smooth functions. Math. Program. 103, 127\u2013152","journal-title":"Math. Program."},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Nesterov, Yu. Dual extrapolation and its applications for solving variational inequalities and related problems. \u2013 CORE Discussion Paper 2003\/68, http:\/\/www.core.ucl.ac.be\/ services\/COREdp03.html (2003)","DOI":"10.2139\/ssrn.988671"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0031-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0031-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0031-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:01Z","timestamp":1559123401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0031-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,24]]},"references-count":8,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,1,30]]}},"alternative-id":["31"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0031-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,24]]}}}