By Topic

A trust-region algorithm based on global SQP for reactive power optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Renjun Zhou ; Coll. of Electr. Eng., Changsha Univ. of Sci. & Technol., Hunan, China ; Yanping Zhang ; Hongming Yang

This paper presents a trust-region algorithm based on global sequential quadratic programming (SQP) for reactive power optimization. This method is not only reliable and accurate which is similar to SQP, but is also global convergent to trust-region search method. To guarantee feasible region of this subproblem is not , inaccurate direction component decomposed method is adopted to compute trust-region subproblem. In order to avoid the Marotos effect, the penalty parameter is effectively regulated in merit function. This example of the computation shows that this algorithm has global convergence and is fast, accurate and reliable.

Published in:

Electrical and Electronics Engineering, 2005 2nd International Conference on

Date of Conference:

7-9 Sept. 2005