The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
An interior-point method for nonlinear optimal power flow using voltage rectangular coordinates
Abstract
The paper describes the solution of an optimal power flow (OPF) problem in rectangular form by an interior-point method (IPM) for nonlinear programming. Some OPF variants when formulated in rectangular form have quadratic objective and quadratic constraints. Such quadratic features allow for ease of matrix setup, and inexpensive incorporation of higher-order information in a predictor-corrector procedure that generally improves IPM performance. The mathematical development of the IPM in the paper is based on a general nonlinear programming problem. Issues in implementation to solve the rectangular OPF are discussed. Computational tests apply the IPM to both the rectangular and polar OPF versions. Test results show that both algorithms perform extremely well.
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
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
Powell, M. J. D. (1969) · The Computer Journal · doi:10.1093/comjnl/12.3.207-a · Cited by 1,757
On the Implementation of a Primal-Dual Interior Point Method
Mehrotra, S. (1992) · SIAM Journal on Optimization · doi:10.1137/0802028 · Cited by 1,613
Optimal Power Flow By Newton Approach
Sun, D., Ashley, B., Brewer, B., Hughes, A., & Tinney, W. (1984) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1984.318284 · Cited by 942
Optimal reactive dispatch through interior point methods
Granville, S. (1994) · IEEE Transactions on Power Systems · doi:10.1109/59.317548 · Cited by 876
A survey of the optimal power flow literature
Huneault, M., & Galiana, F. D. (1991) · IEEE Transactions on Power Systems · doi:10.1109/59.76723 · Cited by 603
Pathways to the Optimal Set in Linear Programming
Megiddo, N. (1989) · Progress in Mathematical Programming · doi:10.1007/978-1-4613-9617-8_8 · Cited by 588
Security analysis and optimization
Stott, B., Alsac, O., & Monticelli, A. J. (1987) · Proceedings of the IEEE · doi:10.1109/proc.1987.13931 · Cited by 553
Cited by
Optimal Planning of Electric-Vehicle Charging Stations in Distribution Systems
Liu, Z., Wen, F., & Ledwich, G. (2013) · IEEE Transactions on Power Delivery · doi:10.1109/tpwrd.2012.2223489 · Cited by 672
Optimal power flow by enhanced genetic algorithm
Bakirtzis, A. G., Biskas, P. N., Zoumas, C. E., & Petridis, V. (2002) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2002.1007886 · Cited by 661
Optimal power flow: a bibliographic survey I: Formulations and deterministic methods
Frank, S., Steponavice, I., & Rebennack, S. (2012) · Energy Systems · doi:10.1007/s12667-012-0056-y · Cited by 554
Exact Convex Relaxation of Optimal Power Flow in Radial Networks
Gan, L., Li, N., Topcu, U., & Low, S. H. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2332712 · Cited by 500
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
Metadata
- Authors
- Torres, G. L., & Quintana, V. H.
- Venue
- IEEE Transactions on Power Systems
- Published
- 1998
- Volume
- 13
- Issue
- 4
- Pages
- 1211-1218
- ISSN
- 0885-8950 (ISSN-L)
- OpenAlex
- W2111568253
- Cited by
- 355
- References
- 7
- FWCI
- 7.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
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.