๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A superlinearly and quadratically convergent SQP type feasible method for constrained optimization

โœ Scribed by Jian Jinbao; Zhang Kecun; Xue Shengjia

Book ID
107500454
Publisher
SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year
2000
Tongue
English
Weight
586 KB
Volume
15
Category
Article
ISSN
1005-1031

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A simple feasible SQP method for inequal
A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
โœ Zhong Jin; Yuqing Wang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 750 KB

In this paper, a simple feasible SQP method for nonlinear inequality constrained optimization is presented. At each iteration, we need to solve one QP subproblem only. After solving a system of linear equations, a new feasible descent direction is designed. The Maratos effect is avoided by using a h

A superlinearly convergent method of qua
A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
โœ Jin-bao Jian; Yi Liu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 297 KB

Combining the norm-relaxed sequential quadratic programming (SQP) method and the idea of method of quasi-strongly sub-feasible directions (MQSSFD) with active set identification technique, a new SQP algorithm for solving nonlinear inequality constrained optimization is proposed. Unlike the previous