{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:27:31Z","timestamp":1775010451328,"version":"3.50.1"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1109\/icc42927.2021.9500847","type":"proceedings-article","created":{"date-parts":[[2021,8,6]],"date-time":"2021-08-06T20:49:21Z","timestamp":1628282961000},"page":"1-6","source":"Crossref","is-referenced-by-count":9,"title":["A Zeroth-Order Continuation Method for Antenna Tuning in Wireless Networks"],"prefix":"10.1109","author":[{"given":"Wenjie","family":"Li","sequence":"first","affiliation":[]},{"given":"David","family":"Lopez-Perez","sequence":"additional","affiliation":[]},{"given":"Xinli","family":"Geng","sequence":"additional","affiliation":[]},{"given":"Harvey","family":"Bao","sequence":"additional","affiliation":[]},{"given":"Qitao","family":"Song","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","first-page":"1833","article-title":"On graduated optimization for stochastic non-convex problems","author":"hazan","year":"2016","journal-title":"International Conference on Machine Learning"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7132.001.0001"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2018.8422746"},{"key":"ref6","first-page":"385","article-title":"Online convex optimization in the bandit setting: gradient descent without a gradient","author":"flaxman","year":"2005","journal-title":"Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms"},{"key":"ref11","article-title":"Making gradient descent optimal for strongly convex stochastic optimization","author":"rakhlin","year":"2011"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/VETECS.2005.1543252"},{"key":"ref8","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2409256"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2019.2933420"},{"key":"ref9","article-title":"On the convergence of adam and beyond","author":"reddi","year":"2019"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2914040"}],"event":{"name":"ICC 2021 - IEEE International Conference on Communications","location":"Montreal, QC, Canada","start":{"date-parts":[[2021,6,14]]},"end":{"date-parts":[[2021,6,23]]}},"container-title":["ICC 2021 - IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9500243\/9500244\/09500847.pdf?arnumber=9500847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:44:07Z","timestamp":1652197447000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9500847\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/icc42927.2021.9500847","relation":{},"subject":[],"published":{"date-parts":[[2021,6]]}}}