Abstract

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 null, 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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.