Title	Developments in Global Optimization [electronic resource] / edited by Immanuel M. Bomze, Tibor Csendes, Reiner Horst, Panos M. Pardalos
Imprint	Boston, MA : Springer US : Imprint: Springer, 1997
Connect to	http://dx.doi.org/10.1007/978-1-4757-2600-8
Descript	XI, 348 p. online resource

In recent years global optimization has found applications in many interesting areas of science and technology including molecular biology, chemical equilibrium problems, medical imaging and networks. The collection of papers in this book indicates the diverse applicability of global optimization. Furthermore, various algorithmic, theoretical developments and computational studies are presented. Audience: All researchers and students working in mathematical programming

NOP โ{128}{148} A Compact Input Format for Nonlinear Optimization Problems -- GLOPT โ{128}{148} A Program for Constrained Global Optimization -- Global Optimization for Imprecise Problems -- New Results on Gap-Treating Techniques in Extended Interval Newton Gauss-Seidel Steps for Global Optimization -- Quadratic Programming with Box Constraints -- Evolutionary Approach to the Maximum Clique Problem: Empirical Evidence on a Larger Scale -- Interval and Bounding Hessians -- On Global Search for Non-Convex Optimal Control Problems -- A Multistart Linkage Algorithm Using First Derivatives -- Convergence Speed of an Integral Method for Computing the Essential Supremum -- Complexity Analysis Integrating Pure Adaptive Search (PAS) and Pure Random Search (PRS) -- LGO โ{128}{148} A Program System for Continuous and Lipschitz Global Optimization -- A Method Using Local Tuning for Minimizing Functions with Lipschitz Derivatives -- Molecular Structure Prediction by Global Optimization -- Optimal Renewal Policy for Slowly Degrading Systems -- Numerical Prediction of Crystal Structures by Simulated Annealing -- Multidimensional Optimization in Image Reconstruction from Projections -- Greedy Randomized Adaptive Search for a Location Problem with Economies of Scale -- An Algorithm for Improving the Bounding Procedure in Solving Process Network Synthesis by a B&B Method