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.

Papers from the April 1995 title conference, held at Princeton University, present current research on global optimization and related applications in science and engineering, highlighting the use of new algorithms for solving large classes of problems in areas such as computational chemistry and biology, structural optimization, and operations research. Topics include Lagrange duality in partly convex programming, global optimization using hyperbolic cross points, and adaptive control via non-convex optimization. Of interest to students and researchers in optimization, engineering, mathematics, and computer sciences. No index. Annotation copyright by Book News, Inc., Portland, OR

Due to the general complementary convex structure underlying most nonconvex optimization problems encountered in applications, convex analysis plays an essential role in the development of global optimization methods. This book develops a coherent and rigorous theory of deterministic global optimization from this point of view. Part I constitutes an introduction to convex analysis, with an emphasis on concepts, properties and results particularly needed for global optimization, including those pertaining to the complementary convex structure. Part II presents the foundation and application of global search principles such as partitioning and cutting, outer and inner approximation, and decomposition to general global optimization problems and to problems with a low-rank nonconvex structure as well as quadratic problems. Much new material is offered, aside from a rigorous mathematical development. Audience: The book is written as a text for graduate students in engineering, mathematics, operations research, computer science and other disciplines dealing with optimization theory. It is also addressed to all scientists in various fields who are interested in mathematical optimization.

Global Optimization has emerged as one of the most exciting new areas of mathematical programming. Global optimization has received a wide attraction from many fields in the past few years, due to the success of new algorithms for addressing previously intractable problems from diverse areas such as computational chemistry and biology, biomedicine, structural optimization, computer sciences, operations research, economics, and engineering design and control. The chapters in this volume focus on recent deterministic methods and stochastic methods for global optimization, distributed computing methods in global optimization, and applications of global optimization in several branches of applied science and engineering, computer science, computational chemistry, structural biology, and bio-informatics.

The NATO Advanced Study Institute on "Algorithms for continuous optimiza tion: the state of the art" was held September 5-18, 1993, at II Ciocco, Barga, Italy. It was attended by 75 students (among them many well known specialists in optimiza tion) from the following countries: Belgium, Brasil, Canada, China, Czech Republic, France, Germany, Greece, Hungary, Italy, Poland, Portugal, Rumania, Spain, Turkey, UK, USA, Venezuela. The lectures were given by 17 well known specialists in the field, from Brasil, China, Germany, Italy, Portugal, Russia, Sweden, UK, USA. Solving continuous optimization problems is a fundamental task in computational mathematics for applications in areas of engineering, economics, chemistry, biology and so on. Most real problems are nonlinear and can be of quite large size. Devel oping efficient algorithms for continuous optimization has been an important field of research in the last 30 years, with much additional impetus provided in the last decade by the availability of very fast and parallel computers. Techniques, like the simplex method, that were already considered fully developed thirty years ago have been thoroughly revised and enormously improved. The aim of this ASI was to present the state of the art in this field. While not all important aspects could be covered in the fifty hours of lectures (for instance multiob jective optimization had to be skipped), we believe that most important topics were presented, many of them by scientists who greatly contributed to their development.

The research of Antanas Zilinskas has focused on developing models for global optimization, implementing and investigating the corresponding algorithms, and applying those algorithms to practical problems. This volume, dedicated to Professor Zilinskas on the occasion of his 60th birthday, contains new survey papers in which leading researchers from the field present various models and algorithms for solving global optimization problems.

This book presents advanced case studies that address a range of important issues arising in space engineering. An overview of challenging operational scenarios is presented, with an in-depth exposition of related mathematical modeling, algorithmic and numerical solution aspects. The model development and optimization approaches discussed in the book can be extended also towards other application areas. The topics discussed illustrate current research trends and challenges in space engineering as summarized by the following list: • Next Generation Gravity Missions • Continuous-Thrust Trajectories by Evolutionary Neurocontrol • Nonparametric Importance Sampling for Launcher Stage Fallout • Dynamic System Control Dispatch • Optimal Launch Date of Interplanetary Missions • Optimal Topological Design • Evidence-Based Robust Optimization • Interplanetary Trajectory Design by Machine Learning • Real-Time Optimal Control • Optimal Finite Thrust Orbital Transfers • Planning and Scheduling of Multiple Satellite Missions • Trajectory Performance Analysis • Ascent Trajectory and Guidance Optimization • Small Satellite Attitude Determination and Control • Optimized Packings in Space Engineering • Time-Optimal Transfers of All-Electric GEO Satellites Researchers working on space engineering applications will find this work a valuable, practical source of information. Academics, graduate and post-graduate students working in aerospace, engineering, applied mathematics, operations research, and optimal control will find useful information regarding model development and solution techniques, in conjunction with real-world applications.