𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New variants of the criss-cross method for linearly constrained convex quadratic programming

✍ Scribed by Arif A. Akkeleş; László Balogh; Tibor Illés

Book ID
108116706
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
390 KB
Volume
157
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New variants of finite criss-cross pivot
New variants of finite criss-cross pivot algorithms for linear programming
✍ Shuzhong Zhang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 106 KB

In this paper we generalize the so-called ®rst-in-last-out pivot rule and the most-often-selected-variable pivot rule for the simplex method, as proposed in S. Zhang (Operations Research Letters 10 (1991) 189±192) to the criss-cross pivot setting where neither the primal nor the dual feasibility is

The FETI family of domain decomposition
The FETI family of domain decomposition methods for inequality-constrained quadratic programming: Application to contact problems with conforming and nonconforming interfaces
✍ Philip Avery; Charbel Farhat 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Two domain decomposition methods with Lagrange multipliers for solving iteratively quadratic programming problems with inequality constraints are presented. These methods are based on the FETI and FETI-DP substructuring algorithms. In the case of linear constraints, they do not perform any Newton-li