Tichatschke / Sachs | System Modeling and Optimization XX | Buch | 978-1-4757-6669-1 | sack.de

Buch, Englisch, Band 130, 330 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 517 g

Reihe: IFIP Advances in Information and Communication Technology

Tichatschke / Sachs

System Modeling and Optimization XX

IFIP TC7 20th Conference on System Modeling and Optimization July 23-27, 2001, Trier, Germany
Softcover Nachdruck of the original 1. Auflage 2003
ISBN: 978-1-4757-6669-1
Verlag: Springer US

IFIP TC7 20th Conference on System Modeling and Optimization July 23-27, 2001, Trier, Germany

Buch, Englisch, Band 130, 330 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 517 g

Reihe: IFIP Advances in Information and Communication Technology

ISBN: 978-1-4757-6669-1
Verlag: Springer US


System Modeling and Optimization XX deals with new developments in the areas of optimization, optimal control and system modeling. The themes range across various areas of optimization: continuous and discrete, numerical and analytical, finite and infinite dimensional, deterministic and stochastic, static and dynamic, theory and applications, foundations and case studies. Besides some classical topics, modern areas are also presented in the contributions, including robust optimization, filter methods, optimization of power networks, data mining and risk control.

This volume contains invited and selected papers from presentations at the 20th IFIP TC7 Conference on System Modeling and Optimization, which took place at the University of Trier, Germany from July 23 to 27, 2001, and which was sponsored by the International Federation for Information Processing (IFIP).

Tichatschke / Sachs System Modeling and Optimization XX jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Invited Speakers.- On Approximate Robust Counterparts of Uncertain Semidefinite and Conic Quadratic Programs.- Global Convergence of a Hybrid Trust-Region SQP-Filter Algorithm for General Nonlinear Programming.- Some Aspects of Nonlinear Semidefinite Programming.- Implicit Filtering and Nonlinear Least Squares Problems.- Data Mining via Support Vector Machines.- Properties of Oligopolistic Market Equilibria in Linearized DC Power Networks with Arbitrage and Supply Function Conjectures.- Risk Control and Optimization for Structural Facilities.- Probability Objectives in Stochastic Programs with Recourse.- Contributed Papers.- Parametric Sensitivity Analysis: A Case Study in Optimal Control of Flight Dynamics.- Solving Quadratic Multicommodity Problems through an Interior-Point Algorithm.- Stability and Local Growth near Bounded-Strong Optimal Controls.- Graph Isomorphism Algorithm by Perfect Matching.- A Reduced SQP Algorithm for the Optimal Control of Semilinear Parabolic Equations.- On Numerical Problems Caused by Discontinuities in Controls.- Solutions Differentiability of Parametric Optimal Control for Elliptic Equations.- Shape Optimization for Dynamic Contact Problems with Friction.- Optimal Shape Design Using Domain Transformations and Continuous Sensitivity Equation Methods.- Adjoint Calculation Using Time-Minimal Program Reversals for Multi-Processor Machines.


Ekkehard W. Sachs is a Professor in the Departments of Mathematics at the University of Trier, Germany, and Virginia Tech, USA. He is also a member of the Interdisciplinary Center of Applied Mathematics (ICAM) at Virginia Tech.

Rainer Tichatschke is a Professor in the Department of Mathematics at the University of Trier, Germany.



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.