## State of the art in global optimization: computational methods and applicationsOptimization problems abound in most fields of science, engineering, and technology. In many of these problems it is necessary to compute the global optimum (or a good approximation) of a multivariable function. The variables that define the function to be optimized can be continuous and/or discrete and, in addition, many times satisfy certain constraints. Global optimization problems belong to the complexity class of NP-hard problems. Such problems are very difficult to solve. Traditional descent optimization algorithms based on local information are not adequate for solving these problems. In most cases of practical interest the number of local optima increases, on the average, exponentially with the size of the problem (number of variables). Furthermore, most of the traditional approaches fail to escape from a local optimum in order to continue the search for the global solution. Global optimization has received a lot of attention in the past ten years, due to the success of new algorithms for solving large classes of problems from diverse areas such as computational chemistry and biology, structural optimization, computer sciences, operations research, economics, and engineering design and control. This book contains refereed invited papers presented at the conference on 'State of the Art in Global Optimization: Computational Methods and Applications' held at Princeton University, April 28-30, 1995. The conference presented current research on global optimization and related applications in science and engineering. The papers included in this book cover a wide spectrum of approaches for solving global optimization problems and applications. The book will be a valuable source of information to faculty, students and researchers in optimization, engineering, mathematics, computer sciences, and related areas. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Global Optimization using Hyperbolic Cross Points | 19 |

Global Minimization of Separable Concave Functions under Linear Constraints | 35 |

S Shi Q Zheng and D Zhuang | 48 |

Copyright | |

29 other sections not shown

### Common terms and phrases

adaptive applied approach approximation Art in Global bound algorithm bound constraints branch and bound component computational concave consider convergence convex convex functions corresponding defined denote domain dynamic efficient encoding equations example feasible point Figure finite Floudas and P.M. formulation function evaluations Genetic Algorithms given global minimum global optimization global optimization algorithm gradient graph grouping problems heuristic implementation initial integer interval arithmetic iteration Kluwer Academic Publishers Lemma linear programming lower bound lower semicontinuous LP relaxation Math Mathematics matrix minimization nodes nonconvex nonlinear programming objective function obtained optimal solution optimization problems optimum P.M. Pardalos eds parameters partition phase procedure programming problems QP subproblem Quadratic Assignment Problem quadratic programming reduced region return the interval sequence simulated annealing solved Step stochastic subset Table techniques template Theorem upper bound upper envelope variables vector