scholarly journals A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization

2009 ◽  
Vol 225 (1) ◽  
pp. 172-186 ◽  
Author(s):  
Jin-bao Jian ◽  
Wei-xin Cheng
1981 ◽  
Author(s):  
Philip E. Gill ◽  
Walter Murray ◽  
Michael A. Saunders ◽  
Margaret H. Wright

Acta Numerica ◽  
1995 ◽  
Vol 4 ◽  
pp. 1-51 ◽  
Author(s):  
Paul T. Boggs ◽  
Jon W. Tolle

Since its popularization in the late 1970s, Sequential Quadratic Programming (SQP) has arguably become the most successful method for solving nonlinearly constrained optimization problems. As with most optimization methods, SQP is not a single algorithm, but rather a conceptual method from which numerous specific algorithms have evolved. Backed by a solid theoretical and computational foundation, both commercial and public-domain SQP algorithms have been developed and used to solve a remarkably large set of important practical problems. Recently large-scale versions have been devised and tested with promising results.


AIChE Journal ◽  
1975 ◽  
Vol 21 (3) ◽  
pp. 479-486 ◽  
Author(s):  
J. S. Newell ◽  
D. M. Himmelblau

2020 ◽  
Vol 25 (5) ◽  
pp. 1729-1755
Author(s):  
Cristian Barbarosie ◽  
◽  
Anca-Maria Toader ◽  
Sérgio Lopes ◽  

Sign in / Sign up

Export Citation Format

Share Document