𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A newɛ-generalized projection method of strongly sub-feasible directions for inequality constrained optimization

✍ Scribed by Jinbao Jian; Guodong Ma; Chuanhao Guo

Book ID
107347286
Publisher
Academy of Mathematics and Systems Science, Chinese Academy of Sciences
Year
2011
Tongue
English
Weight
282 KB
Volume
24
Category
Article
ISSN
1009-6124

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A generalized super-memory gradient proj
A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
✍ Jin-Bao Jian; You-Fang Zeng; Chun-Ming Tang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 362 KB

In this work, combining the properties of the generalized super-memory gradient projection methods with the ideas of the strongly sub-feasible directions methods, we present a new algorithm with strong convergence for nonlinear inequality constrained optimization. At each iteration, the proposed alg

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