{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:48:26Z","timestamp":1768348106668,"version":"3.49.0"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"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":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1109\/tac.2022.3180696","type":"journal-article","created":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T19:37:05Z","timestamp":1654630625000},"page":"4687-4702","source":"Crossref","is-referenced-by-count":6,"title":["Jacobi-Style Iteration for Distributed Submodular Maximization"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0004-5378","authenticated-orcid":false,"given":"Bin","family":"Du","sequence":"first","affiliation":[{"name":"College of Automation Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9063-102X","authenticated-orcid":false,"given":"Kun","family":"Qian","sequence":"additional","affiliation":[{"name":"Department of Civil, Architectural, and Environmental Engineering, The University of Texas at Austin, Austin, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3783-4928","authenticated-orcid":false,"given":"Christian","family":"Claudel","sequence":"additional","affiliation":[{"name":"Department of Civil, Architectural, and Environmental Engineering, The University of Texas at Austin, Austin, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2983-2997","authenticated-orcid":false,"given":"Dengfeng","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Aeronautics and Astronautics, Purdue University, West Lafayette, IN, USA"}]}],"member":"263","reference":[{"key":"ref1","first-page":"235","article-title":"Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies","volume":"9","author":"Krause","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2015.08.022"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2016.2553363"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.21236\/ADA476748"},{"key":"ref5","first-page":"2049","article-title":"Distributed submodular maximization: Identifying representative elements in massive data","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Mirzasoleiman","year":"2013"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623637"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139863"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2794608"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-68874-4_10"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/130929205"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/bf01588971"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121195"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2740625"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2018.2889005"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.23919\/ACC45564.2020.9147476"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2019.03.007"},{"key":"ref19","first-page":"3616","article-title":"Decentralized submodular maximization: Bridging discrete and continuous settings","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Mokhtari","year":"2018"},{"key":"ref20","first-page":"2897","article-title":"Decentralized gradient tracking for continuous DR-submodular maximization","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Xie","year":"2019"},{"key":"ref21","first-page":"150","article-title":"Optimal algorithms for submodular maximization with distributed constraints","author":"Robey","year":"2021","journal-title":"Learn. Dyn. Control. PMLR"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1791212.1791239"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72792-7_15"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0846-1"},{"key":"ref25","first-page":"1145","article-title":"Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Reddi","year":"2016"},{"key":"ref26","first-page":"5564","article-title":"A simple proximal stochastic gradient method for nonsmooth nonconvex optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Li","year":"2018"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492488"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref29","first-page":"41.1","article-title":"Towards minimax policies for online linear optimization with bandit feedback","volume-title":"Proc. Conf. Learn. Theory","author":"Bubeck","year":"2012"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref31","first-page":"5711","article-title":"Learning disentangled representations for recommendation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ma","year":"2019"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1561\/1500000066"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181966"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390191"},{"key":"ref36","article-title":"Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application","author":"Wang","year":"2013"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/9870073\/09789722.pdf?arnumber=9789722","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T02:42:07Z","timestamp":1706755327000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9789722\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":36,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tac.2022.3180696","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9]]}}}