✦ LIBER ✦

A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems

✍ Scribed by Jian, Jin-bao; Li, Jie; Zheng, Hai-yan; Li, Jian-ling

Book ID: 122119094
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 541 KB
Volume: 226
Category: Article
ISSN: 0096-3003
DOI: 10.1016/j.amc.2013.10.082

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A newɛ-generalized projection method of

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

✍ Jinbao Jian; Guodong Ma; Chuanhao Guo 📂 Article 📅 2011 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 282 KB

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