{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T05:05:24Z","timestamp":1780722324631,"version":"3.54.1"},"reference-count":22,"publisher":"Informa UK Limited","issue":"2","funder":[{"DOI":"10.13039\/501100006595","name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","doi-asserted-by":"publisher","award":["MoCOBiDS no. 176\/01.10.2015"],"award-info":[{"award-number":["MoCOBiDS no. 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":[[2019,3,4]]},"DOI":"10.1080\/10556788.2017.1380642","type":"journal-article","created":{"date-parts":[[2017,10,6]],"date-time":"2017-10-06T02:46:54Z","timestamp":1507258014000},"page":"305-335","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":23,"title":["Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming"],"prefix":"10.1080","volume":"34","author":[{"given":"I.","family":"Necoara","sequence":"first","affiliation":[{"name":"Automatic Control and Systems Engineering Department, University Politehnica Bucharest, 060042 Bucharest, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Patrascu","sequence":"additional","affiliation":[{"name":"Automatic Control and Systems Engineering Department, University Politehnica Bucharest, 060042 Bucharest, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F.","family":"Glineur","sequence":"additional","affiliation":[{"name":"Center for Operations Research and Econometrics, Catholic University of Louvain, B-1348 Louvain-la-Neuve, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2017,10,5]]},"reference":[{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1137\/100818327"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-014-0326-z"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2012.745530"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1137\/110826102"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0677-5"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0261-6"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0588-x"},{"key":"CIT0010","doi-asserted-by":"crossref","unstructured":"G. Lan and R. Monteiro, Iteration-complexity of first order augmented Lagrangian methods for convex programming, Mathematical Programming, doi:10.1007\/s10107-015-0861-x, 2015.","DOI":"10.1007\/s10107-015-0861-x"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1137\/090753127"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2294614"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2016.1161763"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2007159"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1137\/120897547"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1137\/070708111"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403425629"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0034-z"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0686-4"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2015.1044898"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2017.1380642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T11:43:34Z","timestamp":1549539814000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2017.1380642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,5]]},"references-count":22,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2017,10,27]]},"published-print":{"date-parts":[[2019,3,4]]}},"alternative-id":["10.1080\/10556788.2017.1380642"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2017.1380642","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,5]]},"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"},{"value":"2016-10-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-09-13","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-10-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}