Improved Sequential Least Squares Programming–Driven Feasible Path Algorithm for Process Optimisation

Sequential least squares programming (SLSQP) algorithm has been shown to be useful for driving the feasible path algorithms for process optimisation. However, the existing SLSQP algorithms still need many function evaluations for computationally challenging process optimisation problems. In the curr...

Full description

Saved in:
Bibliographic Details
Published in:Computer Aided Chemical Engineering Vol. 51; pp. 1279 - 1284
Main Authors: Ma, Yingjie, Zhang, Nan, Li, Jie
Format: Book Chapter
Language:English
Published: 2022
Subjects:
feasible path
line search
numerical errors
process optimisation
SLSQP
process optimisation
feasible path
SLSQP
numerical errors
line search
ISBN:0323958796, 9780323958790
ISSN:1570-7946
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Sequential least squares programming (SLSQP) algorithm has been shown to be useful for driving the feasible path algorithms for process optimisation. However, the existing SLSQP algorithms still need many function evaluations for computationally challenging process optimisation problems. In the current work, we propose several novel strategies to improve both the efficiency and convergence of the SLSQP algorithm. Solving a large-scale process optimisation problem indicates that the algorithm can save computational times by 10-90% with better solutions generated.
ISBN:0323958796
9780323958790
ISSN:1570-7946
DOI:10.1016/B978-0-323-95879-0.50214-9