The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Dynamic Network Energy Management via Proximal Message Passing
Abstract
We consider a network of devices, such as generators, fixed loads, deferrable loads, and storage devices, each with its own dynamic constraints and objective, connected by AC and DC lines. The problem is to minimize the total network objective subject to the device and line constraints over a time horizon. This is a large optimization problem with variables for consumption or generation for each device, power flow for each line, and voltage phase angles at AC buses in each period. We develop a decentralized method for solving this problem called proximal message passing. The method is iterative: At each step, every device exchanges simple messages with its neighbors in the network and then solves its own optimization problem, minimizing its own objective augmented by a term determined by the messages it has received. We show that this message passing method converges to a solution when the device objective and constraints are convex. The method is completely decentralized and needs no global coordination other than iteration synchronization; the problems to be solved by each device can typically be solved extremely efficiently and in parallel. The proximal message passing method is fast enough that even a serial implementation can solve substantial problems in reasonable time frames. We report results for several numerical experiments, demonstrating the method’s speed and scaling, including the solution of a problem instance with over 30 million variables in 5 minutes for a serial implementation; with decentralized computing, the solve time would be less than one second.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Self-citationThe Theory and Practice of Revenue Management
Talluri, K. T., & Van Ryzin, G. J. (2004) · International Series in Operations Research & Management Science · doi:10.1007/b139000 · Cited by 2,243
Cited by
A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems
Molzahn, D. K., Dorfler, F., Sandberg, H., Low, S. H., Chakrabarti, S., Baldick, R., & Lavaei, J. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2720471 · Cited by 1,273
Self-citationResearch on Resilience of Power Systems Under Natural Disasters—A Review
Wang, Y., Chen, C., Wang, J., & Baldick, R. (2016) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2015.2429656 · Cited by 1,116
A Survey on Demand Response Programs in Smart Grids: Pricing Methods and Optimization Algorithms
Vardakas, J. S., Zorba, N., & Verikoukis, C. V. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2341586 · Cited by 953
A survey of distributed optimization
Yang, T., Yi, X., Wu, J., Yuan, Y., Wu, D., Meng, Z., Hong, Y., Wang, H., Lin, Z., & Johansson, K. H. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.05.006 · Cited by 913
On-Line Building Energy Optimization Using Deep Reinforcement Learning
Mocanu, E., Mocanu, D. C., Nguyen, P. H., Liotta, A., Webber, M. E., Gibescu, M., & Slootweg, J. G. (2019) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2018.2834219 · Cited by 649
Metadata
- Authors
- Kraning, M., Chu, E., Lavaei, J., & Boyd, S.
- Venue
- Foundations and Trends in Optimization
- Publisher
- Emerald
- Published
- 2014-01-01
- Volume
- 1
- Issue
- 2
- Pages
- 73-126
- ISSN
- 2167-3888 (ISSN-L)
- 2167-3918
- OpenAlex
- W4292691059
- Cited by
- 237
- References
- 2
- FWCI
- 14.78
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dynamic Network Energy Management via Proximal Message Passing. https://app.cochat.ai/papers/10.1561/2400000002
- The paper
- Kraning, M., Chu, E., Lavaei, J., & Boyd, S. (2014). Dynamic Network Energy Management via Proximal Message Passing. Foundations and Trends in Optimization. https://doi.org/10.1561/2400000002
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.