The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Semidefinite programming for optimal power flow problems
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Primal-Dual Interior-Point Methods
Wright, S. J. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971453 · Cited by 2,391
Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
Parrilo, P. A. (2000) · doi:10.7907/2k6y-ch43 · Cited by 1,802
Dommel, H., & Tinney, W. (1968) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1968.292150 · Cited by 1,664
Cones of Matrices and Set-Functions and 0–1 Optimization
Lovász, L., & Schrijver, A. (1991) · SIAM Journal on Optimization · doi:10.1137/0801013 · Cited by 1,008
Optimal reactive dispatch through interior point methods
Granville, S. (1994) · IEEE Transactions on Power Systems · doi:10.1109/59.317548 · Cited by 876
Handbook of applied optimization
(2002) · Choice Reviews Online · doi:10.5860/choice.40-1593 · Cited by 867
Alizadeh, F., Haeberly, J.-P. A., & Overton, M. L. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496304700 · Cited by 480
An interior point nonlinear programming for optimal power flow problems with a novel data structure
Wei, H., Sasaki, H., Kubokawa, J., & Yokoyama, R. (1998) · IEEE Transactions on Power Systems · doi:10.1109/59.708745 · Cited by 383
Self-citationSolving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
Benson, S. J., Ye, Y., & Zhang, X. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623497328008 · Cited by 276
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475) · doi:10.1109/cdc.2003.1272421 · Cited by 218
Semidefinite programming in combinatorial optimization
Goemans, M. X. (1997) · Mathematical Programming · doi:10.1007/bf02614315 · Cited by 208
An independent benchmarking of SDP and SOCP solvers
Mittelmann, H. D. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0355-5 · Cited by 175
Quintana, V. H., Torres, G. L., & Medina-Palomo, J. (2000) · IEEE Transactions on Power Systems · doi:10.1109/59.852117 · Cited by 139
Semidefinite Programming Relaxations and Algebraic Optimization in Control
Parrilo, P. A., & Lall, S. (2003) · European Journal of Control · doi:10.3166/ejc.9.307-321 · Cited by 137
Convex optimization problems involving finite autocorrelation sequences
Alkire, B., & Vandenberghe, L. (2002) · Mathematical Programming · doi:10.1007/s10107-002-0334-x · Cited by 119
Large scale hydrothermal optimal power flow problems based on interior point nonlinear programming
Wei, H., Sasaki, H., Kubokawa, J., & Yokoyama, R. (2000) · IEEE Transactions on Power Systems · doi:10.1109/59.852150 · Cited by 61
Self-citationSDPARA: SemiDefinite Programming Algorithm paRAllel version
Yamashita, M., Fujisawa, K., & Kojima, M. (2003) · Parallel Computing · doi:10.1016/s0167-8191(03)00087-5 · Cited by 57
Self-citationSemidefinite programming and combinatorial optimization
Rendl, F. (1999) · Applied Numerical Mathematics · doi:10.1016/s0168-9274(98)00097-x · Cited by 53
Cited by
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
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
Zero Duality Gap in Optimal Power Flow Problem
Lavaei, J., & Low, S. H. (2012) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2011.2160974 · Cited by 1,195
Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
Low, S. H. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2309732 · Cited by 929
Distributed Optimal Power Flow for Smart Microgrids
Dall'Anese, E., Zhu, H., & Giannakis, G. B. (2013) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2013.2248175 · Cited by 679
Metadata
- Authors
- Bai, X., Wei, H., Fujisawa, K., & Wang, Y.
- Venue
- International Journal of Electrical Power & Energy Systems
- Publisher
- Elsevier BV
- Published
- 2008-07
- Volume
- 30
- Issue
- 6-7
- Pages
- 383-392
- ISSN
- 0142-0615 (ISSN-L)
- OpenAlex
- W2086664392
- Cited by
- 573
- References
- 18
- FWCI
- 3.59
- 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.