✦ LIBER ✦

New sequential quadratic programming algorithm with consistent subproblems

✍ Scribed by Guoping He; Ziyou Gao; Yanlian Lai

Book ID: 105637986
Publisher: SP Science China Press
Year: 1997
Tongue: English
Weight: 553 KB
Volume: 40
Category: Article
ISSN: 1674-7283
DOI: 10.1007/bf02874433

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving convex quadratic bilevel program

Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm

✍ Jean Bosco Etoa Etoa 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 375 KB

A Feasible Trust-Region Sequential Quadr

A Feasible Trust-Region Sequential Quadratic Programming Algorithm

✍ Wright, Stephen J.; Tenny, Matthew J. 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 293 KB

A Computationally Efficient Feasible Seq

A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm

✍ Lawrence, Craig T.; Tits, André L. 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 275 KB

A sequential quadratic programming algor

A sequential quadratic programming algorithm with an additional equality constrained phase

✍ Morales, J. L.; Nocedal, J.; Wu, Y. 📂 Article 📅 2011 🏛 Oxford University Press 🌐 English ⚖ 302 KB

A new successive quadratic programming a

A new successive quadratic programming algorithm

✍ Zengxin Wei 📂 Article 📅 1992 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 416 KB

A new algorithm for quadratic programmin

A new algorithm for quadratic programming

✍ Tamás Terlaky 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 531 KB

We present a new finite algorithm for quadratic programming. Our algorithm is based on the solution procedures of linear programming (pivoting, Bland's rule, Hungarian Methods, criss-cross method), however this method does not require the enlargement of the basic tableau as Frank-Wolfe method does.