On a nonlinear multiple-centrality-corrections interior-point method for optimal power flow

Large scale nonlinear optimal power flow (OPF) problems have been efficiently solved by extensions from linear programming to nonlinear programming of the primal-dual logarithmic barrier interior-point method and its predictor-corrector variant. Motivated by the impressive performance of the nonlinear predictor-corrector extension, in this paper we extend from linear programming to nonlinear OPF the efficient multiple centrality corrections (MCC) technique that was developed by Gondzio. The numerical performance of the proposed MCC algorithm is evaluated on a set of power networks ranging in size from 118 buses to 2098 buses. Extensive computational results demonstrate that the MCC technique is fast and robust, and outperforms the successful predictor-corrector technique.