Optimal quadratic programming algorithms : With applications to variational inequalities
Solving optimization problems in complex systems often requires the implementation of advanced mathematical techniques. Quadratic programming (QP) is one technique that allows for the optimization of a quadratic function in several variables in the presence of linear constraints. QP problems arise i...
Đã lưu trong:
| Tác giả chính: | |
|---|---|
| Định dạng: | Livre numérique |
| Ngôn ngữ: | Anglais |
| Được phát hành: |
Boston, MA :
Springer US
[20..].
Cham : Springer Nature |
| Loạt: | Springer Optimization and Its Applications
23 |
| Những chủ đề: | |
| Truy cập trực tuyến: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Chú thích: |
Description d'après consultation du 10 octobre 2011 Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Optimal Quadratic Programming Algorithms, Texte imprimé, 9780387848051 |
Mục lục:
- I Background Linear Algebra Optimization II Algorithms Conjugate Gradients for Unconstrained Minimization Equality Constrained Minimization Bound Constrained Minimization Bound and Equality Constrained Minimization III Applications to Variational Inequalities Solution of a Coercive Variational Inequality by FETI#x2014;DP Method Solution of a Semicoercive Variational Inequality by TFETI Method