{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T19:26:44Z","timestamp":1784230004859,"version":"3.55.0"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"General Research Fund from Research Grants Council, Hong Kong","award":["11203122"],"award-info":[{"award-number":["11203122"]}]},{"name":"InnoHK initiative"},{"name":"The Government of the HKSAR"},{"name":"Laboratory for AI-Powered Financial Technologies"},{"name":"NSF","award":["1931662"],"award-info":[{"award-number":["1931662"]}]},{"name":"Caltech Resnick"},{"name":"S2I funds"},{"name":"C3.ai\/UC Berkeley"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Systems Journal"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1109\/jsyst.2022.3201041","type":"journal-article","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T19:33:19Z","timestamp":1663356799000},"page":"673-683","source":"Crossref","is-referenced-by-count":151,"title":["DeepOPF: A Feasibility-Optimized Deep Neural Network Approach for AC Optimal Power Flow Problems"],"prefix":"10.1109","volume":"17","author":[{"given":"Xiang","family":"Pan","sequence":"first","affiliation":[{"name":"Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4763-0037","authenticated-orcid":false,"given":"Minghua","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Data Science, City University of Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9541-0197","authenticated-orcid":false,"given":"Tianyu","family":"Zhao","sequence":"additional","affiliation":[{"name":"Lenovo Machine Intelligence Center, Lenovo, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6476-3048","authenticated-orcid":false,"given":"Steven H.","family":"Low","sequence":"additional","affiliation":[{"name":"Department of Computing and Mathematical Sciences and Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"issue":"8","key":"ref1","first-page":"431","article-title":"Contribution to the economic dispatch problem","volume":"3","author":"Carpentier","year":"1962","journal-title":"Bull. de la Societe Francoise des Electriciens"},{"key":"ref2","first-page":"1","article-title":"History of optimal power flow and formulations","volume":"1","author":"Cain","year":"2012","journal-title":"Federal Energy Regulatory Commission"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2017.8309128"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2021.3124283"},{"key":"ref5","article-title":"The power grid library for benchmarking AC optimal power flow algorithms","author":"Babaeinejadsarookolaee","year":"2019"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2017.2704922"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SmartGridComm.2019.8909795"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2020.3026379"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SmartGridComm47815.2020.9303017"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(91)90009-T"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2021.3054341"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053140"},{"key":"ref13","article-title":"Machine learning for AC optimal power flow","volume-title":"Proc. Int. Conf. Mach. Learn. Workshop","author":"Guha","year":"2019"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SmartGridComm47815.2020.9303008"},{"key":"ref15","article-title":"High-fidelity machine learning approximations of large-scale optimal power flow","author":"Chatzos","year":"2020"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2019.2935711"},{"key":"ref17","article-title":"DC3: A. learning method for optimization with hard constraints","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Donti","year":"2021"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/PTC.2019.8810819"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.23919\/PSCC.2018.8442859"},{"key":"ref20","article-title":"Learning to solve network flow problems via neural decoding","author":"Chen","year":"2020"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2020.2980212"},{"key":"ref22","article-title":"Learning an optimally reduced formulation of OPF through meta-optimization","author":"Robson","year":"2019"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2020.3044839"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP.2019.8918690"},{"key":"ref25","first-page":"1","article-title":"Warm-starting AC optimal power flow with graph neural networks","volume-title":"Proc. 33rd Conf. Neural Inf. Process. Syst. Workshop","author":"Diehl","year":"2019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00067"},{"key":"ref27","article-title":"A learning-boosted quasi-newton method for AC optimal power flow","author":"Baker","year":"2020"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/NAPS56150.2022.10012237"},{"key":"ref29","article-title":"Ensuring DNN solution feasibility for optimization problems with convex constraints and its application to DC optimal power flow problems","author":"Zhao","year":"2021"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2020.3001919"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2021.3127189"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5403"},{"key":"ref33","article-title":"Pypower","year":"2018"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2022.3201041"},{"key":"ref35","article-title":"DeepOPF-NGT: A. fast unsupervised learning approach for solving AC-OPF problems without ground truth","volume-title":"Proc. Int. Conf. Mach. Learn. Workshop","author":"Huang","year":"2021"},{"key":"ref36","article-title":"Deriving fast AC OPF solutions via proximal policy optimization for secure and economic grid operation","author":"Zhou","year":"2020"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2021.3114092"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483453"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2019.08.009"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2014.2323634"},{"key":"ref41","volume-title":"Deep Learning","volume":"1","author":"Goodfellow","year":"2016"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2016.7525170"},{"key":"ref43","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","volume-title":"Proc. COLT. Omnipress","author":"Agarwal","year":"2010"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.3003837"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"ref46","first-page":"2979","article-title":"Depth-width tradeoffs in approximating natural functions with neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"70","author":"Safran","year":"2017"},{"key":"ref47","article-title":"Why deep neural networks for function approximation","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Liang","year":"2017"},{"key":"ref48","article-title":"Power systems test case archive","year":"2018"},{"key":"ref49","article-title":"2000-bus synthetic test case","year":"2022"},{"key":"ref50","article-title":"Power grid lib-v19.05","year":"2019"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2010.2051168"},{"key":"ref52","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma","year":"2015"},{"key":"ref53","article-title":"Adding gradient noise improves learning for very deep networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Neelakantan","year":"2016"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2013.2257780"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3575813.3576874"}],"container-title":["IEEE Systems Journal"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/4267003\/10051137\/9894104-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4267003\/10051137\/09894104.pdf?arnumber=9894104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T21:30:55Z","timestamp":1705959055000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9894104\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3]]},"references-count":55,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jsyst.2022.3201041","relation":{},"ISSN":["1932-8184","1937-9234","2373-7816"],"issn-type":[{"value":"1932-8184","type":"print"},{"value":"1937-9234","type":"electronic"},{"value":"2373-7816","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3]]}}}