2005•Journal of Zhejiang University(Engineering Science)Requires access

Improved large-scale reduced SQP algorithm for process optimization

Jixin Qian

Open publisher page 0 citations

Abstract

To improve the efficiency and stability of reduced sequential quadratic programming(rSQP) algorithm,and extend it to solve much larger scale problems of process systems,an improved rSQP algorithm for optimization of large-scale process systems was presented.In the improved algorithm,a new rule for selection of basis was adopted.Basis was adjusted at every iteration according to the rule,so the stability can be improved obviously.Also,an integrated line search of filter method,with the advantages of normal line search method and filter method,was incorporated into the algorithm to obtain steplength.Numerical results of some benchmark examples and three large examples with variable dimension show that the proposed algorithm can reduce the number of iterations and function evaluations.and is much more effective than standard sequential quadratic programming(SQP) algorithm.Also the stability of rSQP algorithm is improved.

About this research paper

What this paper is about

To improve the efficiency and stability of reduced sequential quadratic programming(rSQP) algorithm,and extend it to solve much larger scale problems of process systems,an improved rSQP algorithm for optimization of large-scale process systems was presented.In the improved algorithm,a new rule for selection of basis was adopted.Basis was adjusted at every iteration according to the rule,so the stability can be improved obviously.Also,an integrated line search of filter method,with the advantages of normal line search method and filter method,was incorporated into the algorithm to obtain steplength.Numerical results of some benchmark examples and three large examples with variable dimension show that the proposed algorithm can reduce the number of iterations and function evaluations.and is much more effective than standard sequential quadratic programming(SQP) algorithm.Also the stability of rSQP algorithm is improved.

Why it matters

A significance statement is not available in the OpenAlex record.

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

To improve the efficiency and stability of reduced sequential quadratic programming(rSQP) algorithm,and extend it to solve much larger scale problems of process systems,an improved rSQP algorithm for optimization of large-scale process systems was presented.In the improved algorithm,a new rule for selection of basis was adopted.Basis was adjusted at every iteration according to the rule,so the stability can be improved obviously.Also,an integrated line search of filter method,with the advantages of normal line search method and filter method,was incorporated into the algorithm to obtain steplength.Numerical results of some benchmark examples and three large examples with variable dimension show that the proposed algorithm can reduce the number of iterations and function evaluations.and is much more effective than standard sequential quadratic programming(SQP) algorithm.Also the stability of rSQP algorithm is improved.

Key concepts: Sequential quadratic programming, Mathematical optimization, Algorithm, Benchmark (surveying), Stability (learning theory), Dimension (graph theory), Mathematics, Scale (ratio)

Related papers

Back to paper searchBrowse research topicsOriginal source
Improved large-scale reduced SQP algorithm for process optimization — Research Paper | ScholarLens