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

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Egile nagusia: Dostál, Zdenek
Formatua: Livre numérique
Hizkuntza:Anglais
Argitaratua: Boston, MA : Springer US [20..].
Cham : Springer Nature
Saila:Springer Optimization and Its Applications 23
Gaiak:
Sarrera elektronikoa:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Oharra: 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
LEADER 03970nam a22004217a 4500
001 941433
008 090610q2000 xx ||| |||| 00| 0 eng d
009 PPN134127870
020 |a 9780387848068 
041 0 |a eng 
082 |a 515.64 
084 |a 90C20. 2000 
084 |a 90C06. 2000 
084 |a 65K05. 2000 
084 |a 65N55. 2000 
100 1 |a Dostál, Zdenek. 
245 1 0 |a Optimal quadratic programming algorithms :  |b With applications to variational inequalities   |c by Zdenek Dostál. 
260 |a Boston, MA :  |b Springer US. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Springer Optimization and Its Applications  |v 23  |x 1931-6828 
500 |a Description d'après consultation du 10 octobre 2011 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
504 |a Bibliogr. Index 
505 1 |a 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 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a 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 in fields as diverse as electrical engineering, agricultural planning, and optics. Given its broad applicability, a comprehensive understanding of quadratic programming is a valuable resource in nearly every scientific field. Optimal Quadratic Programming Algorithms presents recently developed algorithms for solving large QP problems. The presentation focuses on algorithms which are, in a sense optimal, i.e., they can solve important classes of problems at a cost proportional to the number of unknowns. For each algorithm presented, the book details its classical predecessor, describes its drawbacks, introduces modifications that improve its performance, and demonstrates these improvements through numerical experiments. This self-contained monograph can serve as an introductory text on quadratic programming for graduate students and researchers. Additionally, since the solution of many nonlinear problems can be reduced to the solution of a sequence of QP problems, it can also be used as a convenient introduction to nonlinear programming. The reader is required to have a basic knowledge of calculus in several variables and linear algebra 
650 |a Programmation quadratique 
650 |a Mathématiques de l'ingénieur 
650 |a Optimisation mathématique 
776 0 |t Optimal Quadratic Programming Algorithms  |b Texte imprimé  |z 9780387848051 
856 4 |q PDF  |u https://doi.org/10.1007/b138610  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-ZH3KDMN0-D  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747847606  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b138610  |z Accès Université d'Orléans 
856 4 |5 180339901:75086513X  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b138610  |z Accès INSA CVL 
997 |0 941433  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/