𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Enhancements of the Han—Powell method for successive quadratic programming

✍ Scribed by Hern-Shann Chen; Mark A. Stadtherr

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
635 KB
Volume
8
Category
Article
ISSN
0098-1354

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A successive preconditioned conjugate gr
A successive preconditioned conjugate gradient method for the minimization of quadratic and nonlinear functions
✍ K. Davey; M.J. Ward 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 467 KB

This paper is concerned with a conjugate gradient method that utilizes a successive set of preconditioner matrices. The method is developed for the solution of min{f (x): x ∈ R n }, where f is a nonlinear function that is sufficiently smooth to possess a Hessian matrix that is continuous. The theory

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