The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Convex Optimization of Power Systems
Abstract
Optimization is ubiquitous in power system engineering. Drawing on powerful, modern tools from convex optimization, this rigorous exposition introduces essential techniques for formulating linear, second-order cone, and semidefinite programming approximations to the canonical optimal power flow problem, which lies at the heart of many different power system optimizations. Convex models in each optimization class are then developed in parallel for a variety of practical applications like unit commitment, generation and transmission planning, and nodal pricing. Presenting classical approximations and modern convex relaxations side-by-side, and a selection of problems and worked examples, this is an invaluable resource for students and researchers from industry and academia in power systems, optimization, and control.
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
COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS
Vickrey, W. (1961) · The Journal of Finance · doi:10.1111/j.1540-6261.1961.tb02789.x · Cited by 7,722
Guerrero, J. M., Vasquez, J. C., Matas, J., de Vicuna, L. G., & Castilla, M. (2011) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2010.2066534 · Cited by 5,075
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
Branch Flow Model: Relaxations and Convexification—Part I
Farivar, M., & Low, S. H. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2255317 · Cited by 1,541
Volatility of power grids under real-time pricing
Roozbehani, M., Dahleh, M. A., & Mitter, S. K. (2012) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2012.2195037 · Cited by 335
The long-run efficiency of real-time electricity pricing
Borenstein, S. (2005) · The Energy Journal · doi:10.5547/issn0195-6574-ej-vol26-no3-5.bertsekas · Cited by 233
Geometry of injection regions of power networks
Zhang, B., & Tse, D. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2012.2208205 · Cited by 118
Cited by
Strong SOCP Relaxations for the Optimal Power Flow Problem
Kocuk, B., Dey, S. S., & Sun, X. A. (2016) · Operations Research · doi:10.1287/opre.2016.1489 · Cited by 281
A Survey of Relaxations and Approximations of the Power Flow Equations
Molzahn, D. K., & Hiskens, I. A. (2019) · Foundations and Trends® in Electric Energy Systems · doi:10.1561/3100000012 · Cited by 272
van Leeuwen, G., AlSkaif, T., Gibescu, M., & van Sark, W. (2020) · Applied Energy · doi:10.1016/j.apenergy.2020.114613 · Cited by 266
Moehle, N., Busseti, E., Boyd, S., & Wytock, M. (2019) · Springer Optimization and Its Applications · doi:10.1007/978-3-030-22788-3_4 · Cited by 20
Metadata
- Authors
- Taylor, J. A.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2015-02-12
- OpenAlex
- W2175349386
- Cited by
- 225
- References
- 8
- FWCI
- 9.74
- Type
- book
- 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: Convex Optimization of Power Systems. https://app.cochat.ai/papers/10.1017/cbo9781139924672
- The paper
- Taylor, J. A. (2015). Convex Optimization of Power Systems. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9781139924672
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.