Application of sequential quadratic programming based on active set method in cleaner production

被引:4
作者
Xia, Li [1 ]
Ling, Jianyang [1 ]
Xu, Zhen [1 ]
Bi, Rongshan [1 ]
Zhao, Wenying [2 ]
Xiang, Shuguang [1 ]
机构
[1] Qingdao Univ Sci & Technol, Coll Chem Engn, State Key Lab Base Ecochem Engn, Zhengzhou Rd 53, Qingdao 266042, Peoples R China
[2] Qilu Normal Univ, Chem & Chem Engn Fac, Jinan 250013, Shandong, Peoples R China
基金
中国国家自然科学基金;
关键词
Sequential quadratic programming; Active set method; Chemical process simulation; Chemical optimization; Green production; PATH OPTIMIZATION; ALGORITHM;
D O I
10.1007/s10098-021-02207-8
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
On the platform of general chemical process simulation software (it was named Optimization Engineer, OPEN), a general optimization algorithm for chemical process simulation is developed using C + + code. The algorithm is based on sequential quadratic programming (SQP). We adopt the activity set algorithm and the rotation axis algorithm to generate the activity set to solve the quadratic programming sub-problem. The active set method can simplify the number of constraints and speed up the calculation. At the same time, we used limited memory BFGS algorithm (L-BFGS) to simplify the solution of second derivative matrix. The special matrix storage mode of L-BFGS algorithm can save the storage space and speed up the computing efficiency. We use exact penalty function and traditional step-size rule in the algorithm. These two methods can ensure the convergence of the algorithm, a more correct search direction and suitable search step. The example shows that the advanced optimization function can meet the requirements of General Chemical Process Calculation. The number of iterations can reduce by about 6.0%. The computation time can reduce by about 6.5%. We combined this algorithm with chemical simulation technology to develop the optimization function of chemical engineering simulation. This optimization function can play an important role in the process optimization calculation aiming at energy saving and green production.
引用
收藏
页码:413 / 422
页数:10
相关论文
共 50 条
[31]   A Structured Reduced Sequential Quadratic Programming and Its Application to a Shape Design Problem [J].
Terry L. Herdman ;
Kyehong Kang .
Computational Optimization and Applications, 1998, 11 :81-100
[32]   A structured reduced sequential quadratic programming and its application to a shape design problem [J].
Herdman, TL ;
Kang, KH .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1998, 11 (01) :81-100
[33]   Backtracking search integrated with sequential quadratic programming for nonlinear active noise control systems [J].
Khan, Wasim Ullah ;
Ye, ZhongFu ;
Chaudhary, Naveed Ishtiaq ;
Raja, Muhammad Asif Zahoor .
APPLIED SOFT COMPUTING, 2018, 73 :666-683
[34]   Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers [J].
Izmailov, A. F. .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2021, 80 (03) :943-978
[35]   Exploiting Convexity in Direct Optimal Control: a Sequential Convex Quadratic Programming Method [J].
Verschueren, Robin ;
van Duijkeren, Niels ;
Quirynen, Rien ;
Diehl, Moritz .
2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, :1099-1104
[36]   Development of quadratic programming algorithm based on interior point method with estimation mechanism of active constraints [J].
Hashimoto H. ;
Takaguchi Y. ;
Nakamura S. .
IEEJ Transactions on Electronics, Information and Systems, 2010, 130 (06) :1061-1071+22
[37]   An effective nonlinear interval sequential quadratic programming method for uncertain inverse problems [J].
Tang, Jiachang ;
Lei, Yong ;
Zhang, Taolin ;
Yao, Qishui ;
Fu, Chunming ;
Zhan, Lina ;
Mi, Chengji .
STRUCTURES, 2023, 51 :615-627
[38]   A semismooth sequential quadratic programming method for lifted mathematical programs with vanishing constraints [J].
A. F. Izmailov ;
A. L. Pogosyan .
Computational Mathematics and Mathematical Physics, 2011, 51
[39]   Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers [J].
A. F. Izmailov .
Computational Optimization and Applications, 2021, 80 :943-978
[40]   A semismooth sequential quadratic programming method for lifted mathematical programs with vanishing constraints [J].
Izmailov, A. F. ;
Pogosyan, A. L. .
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2011, 51 (06) :919-941