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

A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization

โœ Scribed by Chun-ming Tang, Shuai Liu, Jin-bao Jian, Jian-ling Li

Book ID
120755134
Publisher
Springer US
Year
2013
Tongue
English
Weight
476 KB
Volume
65
Category
Article
ISSN
1017-1398

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