{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T10:59:21Z","timestamp":1719917961633},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,4,2]],"date-time":"2021-04-02T00:00:00Z","timestamp":1617321600000},"content-version":"vor","delay-in-days":1462,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1016\/j.jco.2016.11.001","type":"journal-article","created":{"date-parts":[[2016,11,17]],"date-time":"2016-11-17T16:16:36Z","timestamp":1479399396000},"page":"1-16","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":18,"special_numbering":"C","title":["The exact information-based complexity of smooth convex minimization"],"prefix":"10.1016","volume":"39","author":[{"given":"Yoel","family":"Drori","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"58","key":"10.1016\/j.jco.2016.11.001_br000005","doi-asserted-by":"crossref","first-page":"3235","DOI":"10.1109\/TIT.2011.2182178","article-title":"Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization","volume":"5","author":"Agarwal","year":"2012","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.jco.2016.11.001_br000010","series-title":"Nonlinear Programming","author":"Bertsekas","year":"1999"},{"key":"10.1016\/j.jco.2016.11.001_br000015","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10107-013-0653-0","article-title":"Performance of first-order methods for smooth convex minimization: a novel approach","volume":"145","author":"Drori","year":"2014","journal-title":"Math. Program. A"},{"key":"10.1016\/j.jco.2016.11.001_br000020","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-016-0985-7","article-title":"An optimal variant of kelley\u2019s cutting-plane method","volume":"160","author":"Drori","year":"2016","journal-title":"Math. Program. A"},{"issue":"1","key":"10.1016\/j.jco.2016.11.001_br000025","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jco.2014.08.003","article-title":"On lower complexity bounds for large-scale smooth convex optimization","volume":"31","author":"Guzm\u00e1n","year":"2015","journal-title":"J. Complexity"},{"issue":"1","key":"10.1016\/j.jco.2016.11.001_br000030","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10107-015-0949-3","article-title":"Optimized first-order methods for smooth convex minimization","volume":"159","author":"Kim","year":"2016","journal-title":"Math. Program. A"},{"key":"10.1016\/j.jco.2016.11.001_br000035","series-title":"Optimization II: Numerical Methods for Nonlinear Continuous Optimization","author":"Nemirovski","year":"1999"},{"issue":"2","key":"10.1016\/j.jco.2016.11.001_br000040","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0885-064X(92)90013-2","article-title":"Information-based complexity of linear operator equations","volume":"8","author":"Nemirovsky","year":"1992","journal-title":"J. Complexity"},{"key":"10.1016\/j.jco.2016.11.001_br000045","series-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovsky","year":"1983"},{"key":"10.1016\/j.jco.2016.11.001_br000050","series-title":"Introductory Lectures on Convex Optimization: A Basic Course. Applied Optimization","author":"Nesterov","year":"2004"},{"issue":"10","key":"10.1016\/j.jco.2016.11.001_br000055","doi-asserted-by":"crossref","first-page":"7036","DOI":"10.1109\/TIT.2011.2154375","article-title":"Information-based complexity, feedback and dynamics in convex programming","volume":"57","author":"Raginsky","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.jco.2016.11.001_br000060","series-title":"Variational Analysis. Vol. 317","author":"Rockafellar","year":"2009"},{"key":"10.1016\/j.jco.2016.11.001_br000065","series-title":"Continuous Optimization","first-page":"111","article-title":"On complexity of stochastic programming problems","author":"Shapiro","year":"2005"},{"key":"10.1016\/j.jco.2016.11.001_br000070","first-page":"1","article-title":"Smooth strongly convex interpolation and exact worst-case performance of first-order methods","author":"Taylor","year":"2016","journal-title":"Math. Program. A"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X16301066?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X16301066?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,4,2]],"date-time":"2021-04-02T09:37:10Z","timestamp":1617356230000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0885064X16301066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":14,"alternative-id":["S0885064X16301066"],"URL":"https:\/\/doi.org\/10.1016\/j.jco.2016.11.001","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[2017,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The exact information-based complexity of smooth convex minimization","name":"articletitle","label":"Article Title"},{"value":"Journal of Complexity","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jco.2016.11.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier Inc.","name":"copyright","label":"Copyright"}]}}