{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T04:12:02Z","timestamp":1742875922351,"version":"3.40.2"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1847096","2330154"],"award-info":[{"award-number":["1847096","2330154"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Control Netw. Syst."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1109\/tcns.2024.3488516","type":"journal-article","created":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T17:56:41Z","timestamp":1730311001000},"page":"521-533","source":"Crossref","is-referenced-by-count":0,"title":["A Safe First-Order Method for Pricing-Based Resource Allocation in Safety-Critical Networks"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3371-2226","authenticated-orcid":false,"given":"Berkay","family":"Turan","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2190-3631","authenticated-orcid":false,"given":"Spencer","family":"Hutchinson","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3369-3846","authenticated-orcid":false,"given":"Mahnoosh","family":"Alizadeh","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SMARTGRID.2010.5622077"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2307\/3010473"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354697"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2017.8317837"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879350"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jprocont.2010.12.010"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/sj.jors.2600425"},{"volume-title":"Parallel and Distributed Computation: Numerical Methods","year":"2015","author":"Bertsekas","key":"ref8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/PES.2011.6039082"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82118-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/070708111"},{"issue":"1","key":"ref12","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TCNS.2014.2309751","article-title":"An $ O (1\/k)$ gradient method for network resource allocation problems","volume":"1","author":"Beck","year":"2014","journal-title":"IEEE Trans. Control Netw. Syst."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2294614"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2015.02.038"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC51059.2022.9992972"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-015-0758-0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2017.07.003"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2019.2925267"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2014.2341586"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2167817"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/090770102"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2016.07.008"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2020.3024485"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2019.05.006"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1016\/j.neucom.2021.06.097","article-title":"A review of distributed optimization: Problems, models and algorithms","volume":"483","author":"Zheng","year":"2022","journal-title":"Neurocomputing"},{"issue":"1","key":"ref26","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02592073","article-title":"Projected gradient methods for linearly constrained problems","volume":"39","author":"Calamai","year":"1987","journal-title":"Math. Program."},{"issue":"5","key":"ref27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","article-title":"Constrained minimization methods","volume":"6","author":"Levitin","year":"1966","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"ref28","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"Boyd","year":"2004"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623498344720"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5718026"},{"issue":"3","key":"ref31","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1023\/A:1019155231293","article-title":"Optimization flow control with newton-like algorithm","volume":"15","author":"Athuraliya","year":"2000","journal-title":"Telecommun. Syst."},{"issue":"3","key":"ref32","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10957-009-9566-8","article-title":"Interior-point Lagrangian decomposition method for separable convex optimization","volume":"143","author":"Necoara","year":"2009","journal-title":"J. Optim. Theory Appl."},{"key":"ref33","first-page":"36426","article-title":"Online convex optimization with hard constraints: Towards the best of two worlds and beyond","volume-title":"Proc. 36th Int. Conf. Neural Inf. Process. Syst.","author":"Guo","year":"2022"},{"issue":"3","key":"ref34","first-page":"569","article-title":"Online learning with sample path constraints","volume":"10","author":"Mannor","year":"2009","journal-title":"J. Mach. Learn. Res."},{"key":"ref35","first-page":"1427","article-title":"Online convex optimization with stochastic constraints","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Yu","year":"2017"},{"article-title":"A safe first-order method for pricing-based resource allocation in safety-critical networks","year":"2023","author":"Turan","key":"ref36"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/90.879343"},{"key":"ref38","first-page":"497","article-title":"The impact of the geometric properties of the constraint set in safe optimization with bandit feedback","volume-title":"Learn. Dyn. Control Conf.","author":"Hutchinson","year":"2023"},{"issue":"151","key":"ref39","volume-title":"Convex Bodies: The BrunnMinkowski Theory","author":"Schneider","year":"2014"},{"issue":"1","key":"ref40","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","article-title":"Cubic regularization of Newton method and its global performance","volume":"108","author":"Nesterov","year":"2006","journal-title":"Math. Program."}],"container-title":["IEEE Transactions on Control of Network Systems"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6509490\/10935358\/10738435-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6509490\/10935358\/10738435.pdf?arnumber=10738435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T18:55:07Z","timestamp":1742842507000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10738435\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":40,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcns.2024.3488516","relation":{},"ISSN":["2325-5870","2372-2533"],"issn-type":[{"type":"electronic","value":"2325-5870"},{"type":"electronic","value":"2372-2533"}],"subject":[],"published":{"date-parts":[[2025,3]]}}}