State of the Art in Global Optimization: Computational Methods and Applications
Christodoulos A. Floudas, Panos M. Pardalos
Springer US, Feb 29, 1996 - Mathematics - 654 pages
Optimization problems abound in most fields of science, engineering, and tech nology. 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 prob lems. 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 aver age, 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 engineering design and control, computational chemistry and biology, structural optimization, computer science, operations research, and economics. 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 re search 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.
50 pages matching domain in this book
Results 1-3 of 50
What people are saying - Write a review
We haven't found any reviews in the usual places.
Global Optimization using Hyperbolic Cross Points
Global Minimization of Separable Concave Functions under Linear Constraints
S Shi Q Zheng and D Zhuang
29 other sections not shown
Other editions - View all
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