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

An improved SQP algorithm for inequality constrained optimization

โœ Scribed by Zhibin Zhu; Kecun Zhang; Jinbao Jian

Publisher
Springer
Year
2003
Tongue
English
Weight
273 KB
Volume
58
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient feasible SQP algorithm for
An efficient feasible SQP algorithm for inequality constrained optimization
โœ Zhibin Zhu; Jinbao Jian ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 454 KB

In this paper, an efficient feasible SQP method is proposed to solve nonlinear inequality constrained optimization problems. Here, a new modified method is presented to obtain the revised feasible descent direction. Per single iteration, it is only necessary to solve one QP subproblem and a system o

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