Multilevel Optimization in VLSICAD (Combinatorial Optimization (14))

In the last few decades, multiscale algorithms have become a dominant trend in large-scale scientific computation. Researchers have successfully applied these methods to a wide range of simulation and optimization problems. This book gives a general overview of multiscale algorithms; applications to general combinatorial optimization problems such as graph partitioning and the traveling salesman problem; and VLSICAD applications, including circuit partitioning, placement, and VLSI routing. Additional chapters discuss optimization in reconfigurable computing, convergence in multilevel optimization, and model problems with PDE constraints. __Audience__: Written at the graduate level, the book is intended for engineers and mathematical and computational scientists studying large-scale optimization in electronic design automation. In the last few decades, multiscale algorithms have become a dominant trend in large-scale scientific computation. Researchers have successfully applied these methods to a wide range of simulation and optimization problems. This book gives a general overview of multiscale algorithms; applications to general combinatorial optimization problems such as graph partitioning and the traveling salesman problem; and VLSICAD applications, including circuit partitioning, placement, and VLSI routing. Additional chapters discuss optimization in reconfigurable computing, convergence in multilevel optimization, and model problems with PDE constraints. (Midwest)

this Book Gives A General Overview Of Multiscale Algorithms, Discusses Applications To General Combinatorial Optimization Problems, And Examines Vlsicad Applications. There Is Also Discussion Of Optimization In Reconfigurable Computing, Convergence In Multilevel Optimization, And Model Problems With Pde Constraints. The Book Is Intended For Engineers And Mathematical And Computational Scientists Studying Large-scale Optimization In Electronic Design Automation. The Editors Teach In The Computer Science Department At The University Of California-los Angeles. Annotation ©2003 Book News, Inc., Portland, Or

An optimization problem is the task of minimizing (or maximizing - for definiteness we discuss minimization) a certain real-valued "objective functional" (or "cost", or "energy", or "performance index", etc.) E( ), possibly under a set of equality and/or inequality constraints, where = ( 1,..., n) is a vector (often the discretization of one or several functions) of unknown variables (real or complex numbers, and/or integers, and/or Ising spins, etc.). "Audience: Written at the graduate level, the book is intended for engineers and mathematical and computational scientists studying large-scale optimization in electronic design automation."--BOOK JACKET