Interior-point based algorithms for the solution of optimal power flow problems
By Florin Capitanescu, Mevludin Glavic, Damien Ernst, Louis Wehenkel. 2007
190 citations recorded by the source corpus.
Subfields: Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/e94f172c28549b0166a59dd80cf11408fc1a09c6
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Electrical and Electronic Engineering
- Steven H. Low
- Rabih A. Jabr
- Lingwen Gan
- Na Li
- Louis Wehenkel
- Florin Capitanescu
- Ufuk Topcu
- Daniel D. Molzahn
Citations in the corpus
- Redispatching Active and Reactive Powers Using a Limited Number of Control Actions (2011, methodology): “In all our trials, we have solved the conventional OPF problems by the OPF program [19], which uses the interior point method, and we have solved the MILP problems by the GLPK-v4.”
- Exact Convex Relaxation of Optimal Power Flow in Radial Networks (2013, background): “Some of these algorithms, especially the Newton-Ralphson based ones, are quite successful empirically, but in general, these algorithms are not guaranteed to convergence, nor converge to (nearly) optimal solutions.”
- Sensitivity-Based Approaches for Handling Discrete Variables in Optimal Power Flow Computations (2010, methodology): “In all our trials, we use the interior point OPF solver described in [ 24 ].”
- Optimal Power Flow Using an Extended Conic Quadratic Formulation (2008, methodology): “In retrospect, previous research on interior-point OPF programs reported the use of the voltage polar coordinates model [8], [9], [12], [16], [17], the voltage rectangular model [10], [11], [13], and the current mismatch formulation [22].”
- Experiments with the interior-point method for solving large scale optimal power flow problems (2013, methodology): “Unless otherwise specified, we use the default settings of the MCC algorithm [35] in all computations to enable a fair assessment of the performances of the algorithm.”