Optimization : principles and algorithms

Fiche technique

Format : Broché
Nb de pages : 718 pages
Poids : 1290 g
Dimensions : 16cm X 25cm
Date de parution :
ISBN : 978-2-88915-279-7
EAN : 9782889152797

Optimization

principles and algorithms

de

chez Presses polytechniques et universitaires romandes

Paru le | Broché 718 pages

Professionnels

74.50 Indisponible

Quatrième de couverture

Optimization : Principles and Algorithms

Every engineer and décision scientist must have a good mastery of optimization, an essential element in their toolkit.Thus, this articulate introductory textbook will certainly be welcomed by students and practicing professionals alike. Drawing from his vast teaching experience, the author skillfully leads the reader through a rich choice of topics in a coherent, fluid and tasteful blend of models and methods anchored on the underlying mathematical notions (only prerequisites : first year calculus and linear algebra). Topics range from the dassics to some of the most recent developments in smooth unconstrained and constrained optimization, like descent methods, conjugate gradients, Newton and quasi-Newton methods, linear programming and the simplex method, trust région and interior point methods. Furthermore elements of discrète and combinatorial optimization like network optimization, integer programming and heuristic local search methods are also presented.

This book présents optimization as a modeling tool that beyond supporting problem formulation plus design and implementation of efficient algorithms, also is a language suited for interdisciplinary human interaction. Readers further become aware that while the roots of mathematical optimization go back to the work of giants like Newton, Lagrange, Cauchy, Euler or Gauss, it did not become a discipline on its own until World WarTwo. Also that its présent momentum really resulted from its symbiosis with modem computers, which made it possible to routinely solve problems with millions of variables and constraints.

With his witty, entertaining, yet précisé style, Michel Bierlaire captivates his readers and awakens their desire to try out the presented material in a Creative mode. One of the outstanding assets of this book is the unified, dear and concise rendering of the various algorithms, which makes them easily readable and translatable into any high level programming language. This is an addictive book that I am very pleased to recommend.

Biographie

Michel Bierlaire holds a PhD in mathematics from the University of Namur, Belgium. He is full professor at the School of Architecture, Civil and Environmental Engineering atthe Ecole Polytechnique Fédérale de Lausanne, Switzerland. He has been teaching optimization and opérations research at the EPFL since 1998.