2006Unpublished venueRequires access

Reactive power optimization algorithm based on trust-region global SQP

Renjun Zhou, Yanping Zhang, Jianhua Liu

Open publisher page 2 citations

Abstract

In order to improve the convergence and calculate optimal results reliably and accurately, a trust-region algorithm based on global sequential quadratic programming (SQP) is presented for reactive power optimization. This method combines global SQP with trust-region method. The method of decomposed inaccurate direction component is adopted to compute trust-region sub problem to guarantee feasible region of this sub problem is not null. The penalty parameter is effectively regulated in merit function to avoid the Marotos effect. This example of the computation shows that this algorithm has global convergence and is fast, accurate and reliable

About this research paper

What this paper is about

In order to improve the convergence and calculate optimal results reliably and accurately, a trust-region algorithm based on global sequential quadratic programming (SQP) is presented for reactive power optimization. This method combines global SQP with trust-region method. The method of decomposed inaccurate direction component is adopted to compute trust-region sub problem to guarantee feasible region of this sub problem is not null. The penalty parameter is effectively regulated in merit function to avoid the Marotos effect. This example of the computation shows that this algorithm has global convergence and is fast, accurate and reliable

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In order to improve the convergence and calculate optimal results reliably and accurately, a trust-region algorithm based on global sequential quadratic programming (SQP) is presented for reactive power optimization. This method combines global SQP with trust-region method. The method of decomposed inaccurate direction component is adopted to compute trust-region sub problem to guarantee feasible region of this sub problem is not null. The penalty parameter is effectively regulated in merit function to avoid the Marotos effect. This example of the computation shows that this algorithm has global convergence and is fast, accurate and reliable

Key concepts: Sequential quadratic programming, Trust region, Mathematical optimization, Convergence (economics), Computer science, Computation, Penalty method, Quadratic programming

Related papers

Back to paper searchBrowse research topicsOriginal source
Reactive power optimization algorithm based on trust-region global SQP — Research Paper | ScholarLens