A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints

Authors:
Xiaojiao Tong;Chen Ling;Liqun Qi
Affiliations:
Institute of Mathematics, Changsha University of Science and Technology, Changsha, China;School of Mathematics and Statistics, Zhejiang University of Finance and Economics, Hangzhou, China;Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Venue:
Journal of Computational and Applied Mathematics
Year:
2008

Citing 8
Cited 3

Convergence analysis of some algorithms for solving nonsmooth equations

Mathematics of Operations Research
Semi-infinite programming: theory, methods, and applications

SIAM Review
Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities

Mathematics of Computation
Smoothing Newton and quasi-Newton methods for mixed complementarity problems

Computational Optimization and Applications - Special issue on nonsmooth and smoothing methods
Semismooth Newton Methods for Solving Semi-Infinite Programming Problems

Journal of Global Optimization
A Smoothing Newton Method for Semi-Infinite Programming

Journal of Global Optimization
A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming

SIAM Journal on Optimization
A smoothing projected Newton-type algorithm for semi-infinite programming

Computational Optimization and Applications

New approach for the nonlinear programming with transient stability constraints arising from power systems

Computational Optimization and Applications
A smoothing SQP method for nonlinear programs with stability constraints arising from power systems

Computational Optimization and Applications
Semi-infinite programming method for optimal power flow with transient stability and variable clearing time of faults

Journal of Global Optimization

Quantified Score

Hi-index	7.30

Visualization

Abstract

This paper proposes a new algorithm for solving a type of complicated optimal power flow (OPF) problems in power systems, i.e., OPF problems with transient stability constraints (OTS). The OTS is converted into a semi-infinite programming (SIP) via some suitable function analysis. Then based on the KKT system of the reformulated SIP, a smoothing quasi-Newton algorithm is presented in which the numerical integration is used. The convergence of the algorithm is established. An OTS problem in power system is tested, which shows that the proposed algorithm is promising.