{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T11:13:07Z","timestamp":1778670787658,"version":"3.51.4"},"reference-count":27,"publisher":"Informa UK Limited","issue":"3","funder":[{"DOI":"10.13039\/501100006595","name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","doi-asserted-by":"publisher","award":["MoCOBiDS, 176\/01.10.2015"],"award-info":[{"award-number":["MoCOBiDS, 176\/01.10.2015"]}],"id":[{"id":"10.13039\/501100006595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2016,5,3]]},"DOI":"10.1080\/10556788.2016.1161763","type":"journal-article","created":{"date-parts":[[2016,3,30]],"date-time":"2016-03-30T23:43:08Z","timestamp":1459381388000},"page":"645-678","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":18,"title":["Iteration complexity analysis of dual first-order methods for conic convex programming"],"prefix":"10.1080","volume":"31","author":[{"given":"I.","family":"Necoara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Patrascu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2016,3,30]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2014.2309751"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2013.10.007"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0772-2"},{"key":"CIT0005","first-page":"237","volume":"49","author":"Kelly F.P.","year":"1998","journal-title":"Opsearch"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1070.0261"},{"issue":"1","key":"CIT0007","first-page":"511","volume":"155","author":"Lan G.","year":"2015","journal-title":"Math. Program."},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1080\/10556789808805688"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1287\/moor.18.4.846"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2015.04.011"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2294614"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2015.02.038"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2007159"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-009-9566-8"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1137\/120897547"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1137\/070708111"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"CIT0019","first-page":"10","volume":"88","author":"Nesterov Yu .","year":"2012","journal-title":"Optima"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"CIT0021","first-page":"1","author":"O'Donoghue B.","year":"2013","journal-title":"Found. Comput. Math."},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3"},{"key":"CIT0023","first-page":"1","author":"Tseng P.","year":"2008","journal-title":"SIAM J. Optim."},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0394-2"},{"key":"CIT0025","first-page":"1523","volume":"15","author":"Wang P.W.","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2253218"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-006-9080-1"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2010.2051168"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2016.1161763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,16]],"date-time":"2016-12-16T17:56:22Z","timestamp":1481910982000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2016.1161763"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,30]]},"references-count":27,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2016,3,30]]},"published-print":{"date-parts":[[2016,5,3]]}},"alternative-id":["10.1080\/10556788.2016.1161763"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2016.1161763","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,30]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"}]}}