State of the Art in Global Optimization

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.

Contenu
Lagrange Duality in Partly Convex Programming.- Global Optimization using Hyperbolic Cross Points.- Global Minimization of Separable Concave Functions under Linear Constraints with Totally Unimodular Matrices.- On Existence of Robust Minimizers.- A Branch and Bound Algorithm for the Quadratic Assignment Problem using a Lower Bound Based on Linear Programming.- Dynamic Matrix Factorization Methods for using Formulations Derived from Higher Order Lifting Techniques in the Solution of the Quadratic Assignment Problem.- Conical Coercivity Conditions and Global Minimization on Cones. An Existence Result.- The use of Ordinary Differential Equations in Quadratic Maximization with Integer Constraints.- Adaptive Control via Non-Convex Optimization.- A Decomposition-Based Global Optimization Approach for Solving Bilevel Linear and Quadratic Problems.- Generalized TRUST Algorithms for Global Optimization.- Test Results for an Interval Branch and Bound Algorithm for Equality-Constrained Optimization.- Equivalent Methods for Global Optimization.- A C++ Class Library for Interval Arithmetic in Global Optimization.- On the Convergence of Localisation Search.- Stochastic Approximation with Smoothing for Optimization of an Adaptive Recursive Filter.- The Grouping Genetic Algorithm.- Accelerating Convergence of Branch-and-Bound Algorithms for Quadratically Constrained Optimization Problems.- Distributed Decomposition-Based Approaches in Global Optimization.- A Finite Algorithm for Global Minimization of Separable Concave Programs.- A Pseudo ?-Approximate Algorithm for Feedback Vertex Set.- Iterative Topographical Global Optimization.- Global Optimization for the Chemical and Phase Equilibrium Problem using Interval Analysis.- Nonconvex Global Optimization of the Separable ResourceAllocation Problem with Continuous Variables.- A. D.C. Approach to the Largest Empty Sphere Problem in Higher Dimension.- A General D.C. Approach to Location Problems.- Global Optimization by Parallel Constrained Biased Random Search.- Global Optimization Problems in Computer Vision.- An Application of Optimization to the Problem of Climate Change.- Dynamic Visualization in Modelling and Optimization of Ill Defined Problems.- A New Global Optimization Algorithm for Batch Process Scheduling.- Nonconvexity and Descent in Nonlinear Programming.- Global Optimization of Chemical Processes using Stochastic Algorithms.- Logic-Based Outer-Approximation and Benders Decomposition Algorithms for the Synthesis of Process Networks.- Combinatorially Accelerated Branch-and-Bound Method for Solving the MIP Model of Process Network Synthesis.- Discrete Optimization using String Encodings for the Synthesis of Complete Chemical Processes.