A smoothing SQP method for nonlinear programs with stability constraints arising from power systems

A smoothing SQP method for nonlinear programs with stability constraints arising from power systems

0.00 Avg rating0 Votes
Article ID: iaor2012232
Volume: 51
Issue: 1
Start Page Number: 175
End Page Number: 197
Publication Date: Jan 2012
Journal: Computational Optimization and Applications
Authors: , , ,
Keywords: optimization, programming: nonlinear, matrices
Abstract:

This paper investigates a new class of optimization problems arising from power systems, known as nonlinear programs with stability constraints (NPSC), which is an extension of ordinary nonlinear programs. Since the stability constraint is described generally by eigenvalues or norm of Jacobian matrices of systems, this results in the semismooth property of NPSC problems. The optimal conditions of both NPSC and its smoothing problem are studied. A smoothing SQP algorithm is proposed for solving such optimization problem. The global convergence of algorithm is established. A numerical example from optimal power flow (OPF) is done. The computational results show efficiency of the new model and algorithm.

Reviews

Required fields are marked *. Your email address will not be published.