✦ LIBER ✦

Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions

✍ Scribed by Chun-ming Tang; Jin-bao Jian

Book ID: 113583922
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 311 KB
Volume: 218
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2011.10.055

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simply sequential quadratically constr

A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization

✍ Jian, Jin-Bao; Yang, Su-Min; Tang, Chun-Ming 📂 Article 📅 2013 🏛 Taylor and Francis Group 🌐 English ⚖ 270 KB

A superlinearly convergent norm-relaxed

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

✍ Jian, Jin-bao; Li, Jie; Zheng, Hai-yan; Li, Jian-ling 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 541 KB

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 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

Optimality conditions for 2-regular prob

Optimality conditions for 2-regular problems with nonsmooth objective functions

✍ Arutyunov, A.V.; Izmailov, A.F.; Shvartsman, I. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 523 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