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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Dostál, Zdenek (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer US : Imprint: Springer, 2009.
Edición:1st ed. 2009.
Colección:Springer Optimization and Its Applications, 23
Temas:
Mathematical optimization.
Calculus of variations.
Operations research.
Management science.
Engineering mathematics.
Engineering-Data processing.
Numerical analysis.
Calculus of Variations and Optimization.
Operations Research, Management Science .
Mathematical and Computational Engineering Applications.
Numerical Analysis.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares