Lee / Yen / Tam | Quadratic Programming and Affine Variational Inequalities | Buch | 978-0-387-24277-4 | sack.de

Buch, Englisch, Band 78, 346 Seiten, HC runder Rücken kaschiert, Format (B × H): 160 mm x 241 mm, Gewicht: 1520 g

Reihe: Nonconvex Optimization and Its Applications

Lee / Yen / Tam

Quadratic Programming and Affine Variational Inequalities

A Qualitative Study
2005
ISBN: 978-0-387-24277-4
Verlag: Springer US

A Qualitative Study

Buch, Englisch, Band 78, 346 Seiten, HC runder Rücken kaschiert, Format (B × H): 160 mm x 241 mm, Gewicht: 1520 g

Reihe: Nonconvex Optimization and Its Applications

ISBN: 978-0-387-24277-4
Verlag: Springer US


Quadratic programs and affine variational inequalities represent two fundamental, closely-related classes of problems in the t,heories of mathematical programming and variational inequalities, resp- tively. This book develops a unified theory on qualitative aspects of nonconvex quadratic programming and affine variational inequ- ities. The first seven chapters introduce the reader step-by-step to the central issues concerning a quadratic program or an affine variational inequality, such as the solution existence, necessary and sufficient conditions for a point to belong to the solution set, and properties of the solution set. The subsequent two chapters discuss briefly two concrete nlodels (linear fractional vector optimization and the traffic equilibrium problem) whose analysis can benefit a lot from using the results on quadratic programs and affine variational inequalities. There are six chapters devoted to the study of conti- ity and/or differentiability properties of the characteristic maps and functions in quadratic programs and in affine variational inequa- ties where all the components of the problem data are subject to perturbation. Quadratic programs and affine variational inequa- ties under linear perturbations are studied in three other chapters. One special feature of the presentation is that when a certain pr- erty of a characteristic map or function is investigated, we always try first to establish necessary conditions for it to hold, then we go on to study whether the obtained necessary conditions are suf- cient ones. This helps to clarify the structures of the two classes of problems under consideration.
Lee / Yen / Tam Quadratic Programming and Affine Variational Inequalities jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Quadratic Programming Problems.- Existence Theorems for Quadratic Programs.- Necessary and Sufficient Optimality Conditions for Quadratic Programs.- Properties of the Solution Sets of Quadratic Programs.- Affine Variational Inequalities.- Solution Existence for Affine Variational Inequalities.- Upper-Lipschitz Continuity of the Solution Map in Affine Variational Inequalities.- Linear Fractional Vector Optimization Problems.- The Traffic Equilibrium Problem.- Upper Semicontinuity of the KKT Point Set Mapping.- Lower Semicontinuity of the KKT Point Set Mapping.- Continuity of the Solution Map in Quadratic Programming.- Continuity of the Optimal Value Function in Quadratic Programming.- Directional Differentiability of the Optimal Value Function.- Quadratic Programming under Linear Perturbations: I. Continuity of the Solution Maps.- Quadratic Programming under Linear Perturbations: II. Properties of the Optimal Value Function.- Quadratic Programming under Linear Perturbations: III. The Convex Case.- Continuity of the Solution Map in Affine Variational Inequalities.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.