{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T16:22:34Z","timestamp":1775665354897,"version":"3.50.1"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Israeli Innovation Authority through the 5G-WIN Consortium"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1109\/tcomm.2023.3292472","type":"journal-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T17:14:59Z","timestamp":1688577299000},"page":"5814-5830","source":"Crossref","is-referenced-by-count":35,"title":["Learn to Rapidly and Robustly Optimize Hybrid Precoding"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-7904-2452","authenticated-orcid":false,"given":"Ortal","family":"Lavi","sequence":"first","affiliation":[{"name":"School of ECE, Ben-Gurion University of the Negev, Be’er Sheva, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2234-929X","authenticated-orcid":false,"given":"Nir","family":"Shlezinger","sequence":"additional","affiliation":[{"name":"School of ECE, Ben-Gurion University of the Negev, Be’er Sheva, Israel"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC51304.2022.9833923"},{"key":"ref2","volume-title":"6G\u2014The Next Hyper Connected Experience for all","year":"2020"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2010.092810.091092"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/2000000093"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2884008"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2018.1600727"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1600400"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2843719"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2015.2514261"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2911255"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2020.2975653"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9746362"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2671869"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3073325"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2523903"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2520912"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.001.2000267"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3158894"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2924010"},{"key":"ref20","article-title":"Learning to optimize: A primer and a benchmark","author":"Chen","year":"2021","journal-title":"arXiv:2103.12828"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3126050"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2893928"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2949122"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2951501"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2021.3117410"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3004386"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3080672"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM48099.2022.10001155"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3087233"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2020.3001121"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2023.3247480"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3218802"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SiPS47522.2019.9020494"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2019.8815519"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/OJCOMS.2021.3139858"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2022.3188167"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2022.3201961"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3092350"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/VTC2022-Spring54318.2022.9860467"},{"key":"ref40","first-page":"1","article-title":"Efficient algorithms for smooth minimax optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Thekumparampil"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TAP.2014.2310220"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2549418"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2007.05831"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511841224"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2023.3271431"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2899805"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2021.3132609"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/twc.2023.3241841"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2019.2925975"},{"key":"ref51","first-page":"1497","article-title":"A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Mokhtari"},{"key":"ref52","article-title":"A tutorial on Bayesian optimization","author":"Frazier","year":"2018","journal-title":"arXiv:1807.02811"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511921490"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/10286985\/10173560.pdf?arnumber=10173560","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T13:17:13Z","timestamp":1709299033000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10173560\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10]]},"references-count":53,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2023.3292472","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10]]}}}