Al-Baali / Purnama / Grandinetti | Numerical Analysis and Optimization | Buch | 978-3-030-07918-5 | sack.de

Buch, Englisch, Band 235, 304 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 487 g

Reihe: Springer Proceedings in Mathematics & Statistics

Al-Baali / Purnama / Grandinetti

Numerical Analysis and Optimization

NAO-IV, Muscat, Oman, January 2017

Buch, Englisch, Band 235, 304 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 487 g

Reihe: Springer Proceedings in Mathematics & Statistics

ISBN: 978-3-030-07918-5
Verlag: Springer International Publishing


This volume contains 13 selected keynote papers presented at the Fourth International Conference on Numerical Analysis and Optimization. Held every three years at Sultan Qaboos University in Muscat, Oman, this conference highlights novel and advanced applications of recent research in numerical analysis and optimization. Each peer-reviewed chapter featured in this book reports on developments in key fields, such as numerical analysis, numerical optimization, numerical linear algebra, numerical differential equations, optimal control, approximation theory, applied mathematics, derivative-free optimization methods, programming models, and challenging applications that frequently arise in statistics, econometrics, finance, physics, medicine, biology, engineering and industry. Any graduate student or researched wishing to know the latest research in the field will be interested in this volume.

This book is dedicated to the late Professors Mike JD Powell and Roger Fletcher, who werethe pioneers and leading figures in the mathematics of nonlinear optimization.
Al-Baali / Purnama / Grandinetti Numerical Analysis and Optimization jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Al-Baali, M., Caliciotti, A., Fasano, G. and Roma, M: Quasi-Newton Based Preconditioning and Damped Quasi-Newton Schemes, for Nonlinear Conjugate Gradient Methods.- Bagirov, A.M., Sultanova, N., Al Nuaimat, A. and Taheri S: Solving Minimax Problems: Local Smoothing vs Global Smoothing.- Bagherpour, N. and Mahdavi-Amiri, N: Competitive Error in Variables Approach and Algorithms for Finding Positive Definite Solutions of Linear Systems of Matrix Equations.- Duff, I., Lopez, F. and Nakov, S: Sparse Direct Solution on Parallel Computers.- Gay, D. M: Revisiting Expression Representations for Nonlinear AMPL Models.- Hintermuller, M. and Strogies, N: On the Consistency of RK Methods up to Order 3 Applied to the Optimal Control of Scalar Conservation Laws.- Liao, L-Z. and Dai, Y-H: A Time Delay Neural Network Model for Unconstrained Nonconvex Optimization.- Ma, D., Judd, K., Orban, D. and Saunders, M: Stabilized Optimization via an NCL Algorithm.- Mittelmann, H: Combinatorial Optimization Problems in Engineering Applications.- Pani, A. K. and Kundu, S: Optimal Error Estimates for Semidiscrete Galerkin Approximations to Multi-dimensional Sobolev Equations with Burgers' Type Nonlinearity.- Pisciella, P., Vespucci, M. T., Vigan`o, G., Rossi, M. and Moneta, D: Optimal Power Flow Analysis in Power Dispatch for Distribution Networks.- Potra, F: Equilibria and Weighted Complementarity Problems.- Roos, K: A Mathematical Approach to Living on Sinking Ground.


Mehiddin Al-Baali, Sultan Qaboos University, Department of Mathematics and Statistics, Muscat, Oman.

Lucio Grandinetti, Dipartimento di Ingegneria Informatica, Modellistica, Elettronica e Sistemistica, Calabria University, Arcavacata di Rende, Italy.

Anton Purnama, Sultan Qaboos University, Department of Mathematics and Statistics, Muscat, Oman.


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.