{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T18:35:22Z","timestamp":1779302122019,"version":"3.51.4"},"reference-count":81,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Australian Research Council Discovery Early Career Researcher funded by the Australian Government","award":["DE210101056"],"award-info":[{"award-number":["DE210101056"]}]},{"name":"UK Research and Innovation (UKRI) through the UK Government\u2019s Horizon Europe Funding Guarantee","award":["EP\/X032051\/1"],"award-info":[{"award-number":["EP\/X032051\/1"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1109\/tit.2024.3412129","type":"journal-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T18:09:27Z","timestamp":1718129367000},"page":"5710-5730","source":"Crossref","is-referenced-by-count":6,"title":["A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4052-969X","authenticated-orcid":false,"given":"Kerry","family":"He","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer System Engineering, Monash University, Clayton, VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5456-0180","authenticated-orcid":false,"given":"James","family":"Saunderson","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer System Engineering, Monash University, Clayton, VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6026-4102","authenticated-orcid":false,"given":"Hamza","family":"Fawzi","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Cambridge, U.K"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054753"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054855"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1998.708959"},{"issue":"10","key":"ref4","first-page":"2583","article-title":"Numerical experiments on the capacity of quantum channel with entangled input states","volume":"84","author":"Osawa","year":"2001","journal-title":"IEICE Trans. Fundam. Electron., Commun. Comput. Sci."},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849608"},{"key":"ref6","article-title":"Computing the classical-quantum channel capacity: Experiments on a blahut-arimoto type algorithm and an approximate solution for the binary inputs, two-dimensional outputs channel","author":"Li","year":"2019","journal-title":"arXiv:1905.08235"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3034471"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0817"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/16M1099546"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1284-2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3239955"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459348"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0957-3"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-021-00339-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref17","first-page":"173","author":"O\u2019Sullivan","year":"1998","journal-title":"Alternating minimization algorithms: From Blahut\u2013Arimoto to expectationmaximization,\u201d in Codes, Curves, and Signals: Common Threads in Communications"},{"key":"ref18","article-title":"Iterative minimization algorithm on a mixture family","author":"Hayashi","year":"2023","journal-title":"arXiv:2302.06905"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920243"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405276"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4960131"},{"key":"ref22","author":"Nemirovskij","year":"1983","journal-title":"Problem Complexity and Method Efficiency in Optimization"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"ref24","article-title":"On accelerated proximal gradient methods for convex-concave optimization","author":"Tseng","journal-title":"SIAM J. Optimization"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/738"},{"key":"ref27","first-page":"3427","article-title":"A Bregman divergence view on the difference-of-convex algorithm","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Faust"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0446-y"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.26421\/QIC5.1-2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2503755"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-0998-2"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-018-9385-0"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/aab285"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-018-1428-9"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834648"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.82.052336"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-015-1024-y"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.98.062336"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/ab0438"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-07-26-77"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9781139525343"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1017\/9781316848142"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1515\/9783110642490"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(67)90040-7"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/19M130858X"},{"issue":"1","key":"ref48","first-page":"3","article-title":"Primer on monotone operator methods","volume":"15","author":"Ryu","year":"2016","journal-title":"Appl. Comput. Math."},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.2307\/1907579"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/140963467"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/16M1092015"},{"key":"ref52","volume-title":"The MOSEK Optimization Toolbox for MATLAB Manual","year":"2022"},{"key":"ref53","volume-title":"CVX: MATLAB Software for Disciplined Convex Programming","author":"Grant","year":"2014"},{"key":"ref54","first-page":"95","article-title":"Graph implementations for nonsmooth convex programs","volume-title":"Recent Advances in Learning and Control (Lecture Notes in Control and Information Sciences)","author":"Grant","year":"2008"},{"key":"ref55","volume-title":"QETLAB: A MATLAB Toolbox for Quantum Entanglement","author":"Johnston","year":"2016"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1063\/5.0038838"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.56.131"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/18.651037"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.802612"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1063\/1.1497701"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834406"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2215575"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2271772"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.115.070503"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.91.025001"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/529\/10428"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780545"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1016\/S0375-9601(96)00706-2"},{"key":"ref70","first-page":"1481","article-title":"Online self-concordant and relatively smooth minimization, with applications to online portfolio selection and learning quantum states","volume-title":"Proc. Int. Conf. Algorithmic Learn. Theory","author":"Tsai"},{"key":"ref71","article-title":"Faster stochastic first-order method for maximum-likelihood quantum state tomography","author":"Tsai","year":"2022","journal-title":"arXiv:2211.12880"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-024-09651-0"},{"key":"ref73","article-title":"The information bottleneck method","author":"Tishby","year":"2000","journal-title":"arXiv:physics\/0004057"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849518"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-015-0969-1"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-017-9954-1"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2878412"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.22331\/q-2023-03-02-936"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1137\/0803026"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511840371"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04150-6"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10599340\/10552808.pdf?arnumber=10552808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T05:54:34Z","timestamp":1721368474000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10552808\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":81,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3412129","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8]]}}}