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...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Boston, MA :
Springer US,
2009.
|
| Series: | Springer Optimization and Its Applications,
23 |
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Table of Contents:
- 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.