{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:22:46Z","timestamp":1725600166734},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262736","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T23:03:47Z","timestamp":1516316627000},"page":"188-195","source":"Crossref","is-referenced-by-count":2,"title":["Optimal convergence and adaptation for utility optimal opportunistic scheduling"],"prefix":"10.1109","author":[{"given":"Michael J.","family":"Neely","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2591971.2591990"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2449323"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/16M1059011"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","author":"nesterov","year":"2004","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"journal-title":"Convex Analysis and Optimization","year":"2003","author":"bertsekas","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262736"},{"journal-title":"A simple convergence time analysis of drift-plus-penalty for stochastic optimization and convex programs","year":"2014","author":"neely","key":"ref4"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-79995-2","author":"neely","year":"2010","journal-title":"Stochastic Network Optimization with Application to Communication and Queueing Systems"},{"key":"ref6","article-title":"Optimality of certain channel aware scheduling policies","author":"agrawal","year":"2002","journal-title":"Proc Annu Allerton Conf Commun Control and Comp"},{"key":"ref5","article-title":"Asymptotic properties of proportional-fair sharing algorithms","author":"kushner","year":"2002","journal-title":"Proc Annu Allerton Conf Commun Control and Comp"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-005-1450-0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900405"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2304421"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-006-0067-2"}],"event":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2017,10,3]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253908\/8262705\/08262736.pdf?arnumber=8262736","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T21:30:55Z","timestamp":1660339855000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262736\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262736","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}