This book is an up-to-date documentation of the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The well-structured wealth of problems, algorithms, results, and techniques introduced systematically will make the book an indispensible source of reference for professionals. The smooth integration of numerous illustrations, examples, and exercises make this monograph an ideal textbook.

The volume is dedicated to Stephen Smale on the occasion of his 80th birthday.Besides his startling 1960 result of the proof of the Poincare conjecture for all dimensionsgreater than or equal to five, Smale's ground breaking contributions invarious fields in Mathematics have marked the second part of the 20th century andbeyond. Stephen Smale has done pioneering work in differential topology, globalanalysis, dynamical systems, nonlinear functional analysis, numerical analysis, theoryof computation and machine learning as well as applications in the physical andbiological sciences and economics. In sum, Stephen Smale has manifestly brokenthe barriers among the different fields of mathematics and dispelled some remainingprejudices. He is indeed a universal mathematician. Smale has been honoredwith several prizes and honorary degrees including, among others, the Fields Medal(1966), The Veblen Prize (1966), the National Medal of Science (1996) and theWolfPrize (2006/2007)."

This book includes a collection of research articles presented at the "6th International Workshop on Hydro Scheduling in Competitive Electricity Markets". The workshop was a unique and intimate forum for researchers and practitioners to present state-of-the-art research and development concerning novel methodological findings, best practices and real-life applications of hydro scheduling. It also provided a platform for discussing the developments that are taking place in the industry, sharing different experiences and discussing future trends related to this area. This proceedings book is a collection of the most relevant, high-quality articles from the workshop. Discussing the state-of-the-art in the field of hydro scheduling, it is a valuable resource for a wide audience of researchers and practitioners in the field now and in the interesting and challenging times ahead.

Interest in constrained optimization originated with the simple linear pro gramming model since it was practical and perhaps the only computationally tractable model at the time. Constrained linear optimization models were soon adopted in numerous application areas and are perhaps the most widely used mathematical models in operations research and management science at the time of this writing. Modelers have, however, found the assumption of linearity to be overly restrictive in expressing the real-world phenomena and problems in economics, finance, business, communication, engineering design, computational biology, and other areas that frequently demand the use of nonlinear expressions and discrete variables in optimization models. Both of these extensions of the linear programming model are NP-hard, thus representing very challenging problems. On the brighter side, recent advances in algorithmic and computing technology make it possible to re visit these problems with the hope of solving practically relevant problems in reasonable amounts of computational time. Initial attempts at solving nonlinear programs concentrated on the de velopment of local optimization methods guaranteeing globality under the assumption of convexity. On the other hand, the integer programming liter ature has concentrated on the development of methods that ensure global optima. The aim of this book is to marry the advancements in solving nonlinear and integer programming models and to develop new results in the more general framework of mixed-integer nonlinear programs (MINLPs) with the goal of devising practically efficient global optimization algorithms for MINLPs."

Functional analysis owes much of its early impetus to problems that arise in the calculus of variations. In turn, the methods developed there have been applied to optimal control, an area that also requires new tools, such as nonsmooth analysis. This self-contained textbook gives a complete course on all these topics. It is written by a leading specialist who is also a noted expositor. This book provides a thorough introduction to functional analysis and includes many novel elements as well as the standard topics. A short course on nonsmooth analysis and geometry completes the first half of the book whilst the second half concerns the calculus of variations and optimal control. The author provides a comprehensive course on these subjects, from their inception through to the present. A notable feature is the inclusion of recent, unifying developments on regularity, multiplier rules, and the Pontryagin maximum principle, which appear here for the first time in a textbook. Other major themes include existence and Hamilton-Jacobi methods. The many substantial examples, and the more than three hundred exercises, treat such topics as viscosity solutions, nonsmooth Lagrangians, the logarithmic Sobolev inequality, periodic trajectories, and systems theory. They also touch lightly upon several fields of application: mechanics, economics, resources, finance, control engineering. Functional Analysis, Calculus of Variations and Optimal Control is intended to support several different courses at the first-year or second-year graduate level, on functional analysis, on the calculus of variations and optimal control, or on some combination. For this reason, it has been organized with customization in mind. The text also has considerable value as a reference. Besides its advanced results in the calculus of variations and optimal control, its polished presentation of certain other topics (for example convex analysis, measurable selections, metric regularity, and nonsmooth analysis) will be appreciated by researchers in these and related fields.

Bilevel programming problems are hierarchical optimization problems where the constraints of one problem (the so-called upper level problem) are defined in part by a second parametric optimization problem (the lower level problem). If the lower level problem has a unique optimal solution for all parameter values, this problem is equivalent to a one-level optimization problem having an implicitly defined objective function. Special emphasize in the book is on problems having non-unique lower level optimal solutions, the optimistic (or weak) and the pessimistic (or strong) approaches are discussed. The book starts with the required results in parametric nonlinear optimization. This is followed by the main theoretical results including necessary and sufficient optimality conditions and solution algorithms for bilevel problems. Stationarity conditions can be applied to the lower level problem to transform the optimistic bilevel programming problem into a one-level problem. Properties of the resulting problem are highlighted and its relation to the bilevel problem is investigated. Stability properties, numerical complexity, and problems having additional integrality conditions on the variables are also discussed. Audience: Applied mathematicians and economists working in optimization, operations research, and economic modelling. Students interested in optimization will also find this book useful.

Computer Science and Operations Research continue to have a synergistic relationship and this book represents the results of the cross-fertilization between OR/MS and CS/AI. It is this interface of OR/CS that makes possible advances that could not have been achieved in isolation. Taken collectively, these articles are indicative of the state of the art in the interface between OR/MS and CS/AI and of the high-caliber research being conducted by members of the INFORMS Computing Society.

This volume contains, in part, a selection of papers presented at the sixth Australian Optimization Day Miniconference (Ballarat, 16 July 1999), and the Special Sessions on Nonlinear Dynamics and Optimization and Operations Re search - Methods and Applications, which were held in Melbourne, July 11-15 1999 as a part of the Joint Meeting of the American Mathematical Society and Australian Mathematical Society. The editors have strived to present both con tributed papers and survey style papers as a more interesting mix for readers. Some participants from the meetings mentioned above have responded to this approach by preparing survey and 'semi-survey' papers, based on presented lectures. Contributed paper, which contain new and interesting results, are also included. The fields of the presented papers are very large as demonstrated by the following selection of key words from selected papers in this volume: * optimal control, stochastic optimal control, MATLAB, economic models, implicit constraints, Bellman principle, Markov process, decision-making under uncertainty, risk aversion, dynamic programming, optimal value function. * emergent computation, complexity, traveling salesman problem, signal estimation, neural networks, time congestion, teletraffic. * gap functions, nonsmooth variational inequalities, derivative-free algo rithm, Newton's method. * auxiliary function, generalized penalty function, modified Lagrange func tion. * convexity, quasiconvexity, abstract convexity.

Although the monograph Progress in Optimization I: Contributions from Aus tralasia grew from the idea of publishing a proceedings of the Fourth Optimiza tion Day, held in July 1997 at the Royal Melbourne Institute of Technology, the focus soon changed to a refereed volume in optimization. The intention is to publish a similar book annually, following each Optimization Day. The idea of having an annual Optimization Day was conceived by Barney Glover; the first of these Optimization Days was held in 1994 at the University of Ballarat. Barney hoped that such a yearly event would bring together the many, but widely dispersed, researchers in Australia who were publishing in optimization and related areas such as control. The first Optimization Day event was followed by similar conferences at The University of New South Wales (1995), The University of Melbourne (1996), the Royal Melbourne Institute of Technology (1997), and The University of Western Australia (1998). The 1999 conference will return to Ballarat University, being organized by Barney's long-time collaborator Alex Rubinov. In recent years the Optimization Day has been held in conjunction with other locally-held national or international conferences. This has widened the scope of the monograph with contributions not only coming from researchers in Australia and neighboring regions but also from their collaborators in Europe and North America."

A pioneering look at the fundamental role of logic in optimization and constraint satisfaction

While recent efforts to combine optimization and constraint satisfaction have received considerable attention, little has been said about using logic in optimization as the key to unifying the two fields. Logic-Based Methods for Optimization develops for the first time a comprehensive conceptual framework for integrating optimization and constraint satisfaction, then goes a step further and shows how extending logical inference to optimization allows for more powerful as well as flexible modeling and solution techniques. Designed to be easily accessible to industry professionals and academics in both operations research and artificial intelligence, the book provides a wealth of examples as well as elegant techniques and modeling frameworks ready for implementation. Timely, original, and thought-provoking, Logic-Based Methods for Optimization:

• Demonstrates the advantages of combining the techniques in problem solving
• Offers tutorials in constraint satisfaction/constraint programming and logical inference
• Clearly explains such concepts as relaxation, cutting planes, nonserial dynamic programming, and Bender’s decomposition
• Reviews the necessary technologies for software developers seeking to combine the two techniques
• Features extensive references to important computational studies
• And much more

This introductory textbook adopts a practical and intuitive approach, rather than emphasizing mathematical rigor. Computationally oriented books in this area generally present algorithms alone, and expect readers to perform computations by hand, and are often written in traditional computer languages, such as Basic, Fortran or Pascal. This book, on the other hand, is the first text to use Mathematica to develop a thorough understanding of optimization algorithms, fully exploiting Mathematica's symbolic, numerical and graphic capabilities.

This book introduces a holistic approach to ship design and its optimisation for life-cycle operation. It deals with the scientific background of the adopted approach and the associated synthesis model, which follows modern computer aided engineering (CAE) procedures. It integrates techno-economic databases, calculation and multi-objective optimisation modules and s/w tools with a well-established Computer-Aided Design (CAD) platform, along with a Virtual Vessel Framework (VVF), which will allow virtual testing before the building phase of a new vessel. The resulting graphic user interface (GUI) and information exchange systems enable the exploration of the huge design space to a much larger extent and in less time than is currently possible, thus leading to new insights and promising new design alternatives. The book not only covers the various stages of the design of the main ship system, but also addresses relevant major onboard systems/components in terms of life-cycle performance to offer readers a better understanding of suitable outfitting details, which is a key aspect when it comes the outfitting-intensive products of international shipyards. The book disseminates results of the EU funded Horizon 2020 project HOLISHIP.

Focused on efficient simulation-driven multi-fidelity optimization techniques, this monograph on simulation-driven optimization covers simulations utilizing physics-based low-fidelity models, often based on coarse-discretization simulations or other types of simplified physics representations, such as analytical models. The methods presented in the book exploit as much as possible any knowledge about the system or device of interest embedded in the low-fidelity model with the purpose of reducing the computational overhead of the design process. Most of the techniques described in the book are of response correction type and can be split into parametric (usually based on analytical formulas) and non-parametric, i.e., not based on analytical formulas. The latter, while more complex in implementation, tend to be more efficient. The book presents a general formulation of response correction techniques as well as a number of specific methods, including those based on correcting the low-fidelity model response (output space mapping, manifold mapping, adaptive response correction and shape-preserving response prediction), as well as on suitable modification of design specifications. Detailed formulations, application examples and the discussion of advantages and disadvantages of these techniques are also included. The book demonstrates the use of the discussed techniques for solving real-world engineering design problems, including applications in microwave engineering, antenna design, and aero/hydrodynamics.

Lagrange and penalty function methods provide a powerful approach, both as a theoretical tool and a computational vehicle, for the study of constrained optimization problems. However, for a nonconvex constrained optimization problem, the classical Lagrange primal-dual method may fail to find a mini mum as a zero duality gap is not always guaranteed. A large penalty parameter is, in general, required for classical quadratic penalty functions in order that minima of penalty problems are a good approximation to those of the original constrained optimization problems. It is well-known that penaity functions with too large parameters cause an obstacle for numerical implementation. Thus the question arises how to generalize classical Lagrange and penalty functions, in order to obtain an appropriate scheme for reducing constrained optimiza tion problems to unconstrained ones that will be suitable for sufficiently broad classes of optimization problems from both the theoretical and computational viewpoints. Some approaches for such a scheme are studied in this book. One of them is as follows: an unconstrained problem is constructed, where the objective function is a convolution of the objective and constraint functions of the original problem. While a linear convolution leads to a classical Lagrange function, different kinds of nonlinear convolutions lead to interesting generalizations. We shall call functions that appear as a convolution of the objective function and the constraint functions, Lagrange-type functions."

The book begins with an introduction to some of the basic concepts and results on chaotic dynamical systems. Next it turns to a detailed self-contained summary of the literature on discounted dynamic optimization. The first two chapters are of particular pedagogical interest. The volume also brings together a number of outstanding advanced research papers on complex behavior of dynamic economic models. These make it clear that complexity cannot be dismissed as "exceptional" or "pathological" and, for explanation and prediction of economic variables, it is imperative to develop models with special structures suggested by empirical studies. Graduate students in economics will find the book valuable for an introduction to optimization and chaos. Specialists will find new directions to explore themes like robustness of chaotic behavior and the role of discounting in generating cycles and complexity.

This textbook examines a broad range of problems in science and engineering, describing key numerical methods applied to real life. The case studies presented are in such areas as data fitting, vehicle route planning and optimal control, scheduling and resource allocation, sensitivity calculations and worst-case analysis.

Chapters are self-contained with exercises provided at the end of most sections. Nonlinear Optimization with Engineering Applications is ideal for self-study and classroom use in engineering courses at the senior undergraduate or graduate level. The book will also appeal to postdocs and advanced researchers interested in the development and use of optimization algorithms.

The results presented in this book are a product of research conducted by the author independently and in collaboration with other researchers in the field. In this light, this work encompasses the most recent collection of various concepts of regularity and nonsmooth analysis into one monograph. The first part of the book attempts to present an accessible and thorough introduction to nonsmooth analysis theory. Main concepts and some useful results are stated and illustrated through examples and exercises. The second part gathers the most prominent and recent results of various regularity concepts of sets, functions, and set-valued mappings in nonsmooth analysis. The third and final section contains six different application, with comments in relation to the existing literature.

The objective of this book is to advance the current knowledge of sensor research particularly highlighting recent advances, current work, and future needs. The goal is to share current technologies and steer future efforts in directions that will benefit the majority of researchers and practitioners working in this broad field of study.

This book explores fundamental aspects of geometric network optimisation with applications to a variety of real world problems. It presents, for the first time in the literature, a cohesive mathematical framework within which the properties of such optimal interconnection networks can be understood across a wide range of metrics and cost functions. The book makes use of this mathematical theory to develop efficient algorithms for constructing such networks, with an emphasis on exact solutions. Marcus Brazil and Martin Zachariasen focus principally on the geometric structure of optimal interconnection networks, also known as Steiner trees, in the plane. They show readers how an understanding of this structure can lead to practical exact algorithms for constructing such trees. The book also details numerous breakthroughs in this area over the past 20 years, features clearly written proofs, and is supported by 135 colour and 15 black and white figures. It will help graduate students, working mathematicians, engineers and computer scientists to understand the principles required for designing interconnection networks in the plane that are as cost efficient as possible.

This book examines the main methodological and theoretical developments in stochastic global optimization. It is designed to inspire readers to explore various stochastic methods of global optimization by clearly explaining the main methodological principles and features of the methods. Among the book's features is a comprehensive study of probabilistic and statistical models underlying the stochastic optimization algorithms.

Variational principles have proven to be surprisingly fertile. For example, Fermat used variational methods to demonstrate that light follows the fastest route from one point to another, an idea which came to be a cornerstone of geometrical optics. This book explains variational principles and charts their use throughout modern physics. It examines the analytical mechanics of Lagrange and Hamilton, the basic tools of any physicist. The book also offers simple but rich first impressions of Einstein’s General Relativity, Feynman’s Quantum Mechanics, and more that reveal amazing interconnections between various fields of physics.

The field of global optimization has been developing at a rapid pace. There is a journal devoted to the topic, as well as many publications and notable books discussing various aspects of global optimization. This book is intended to complement these other publications with a focus on stochastic methods for global optimization. Stochastic methods, such as simulated annealing and genetic algo rithms, are gaining in popularity among practitioners and engineers be they are relatively easy to program on a computer and may be cause applied to a broad class of global optimization problems. However, the theoretical performance of these stochastic methods is not well under stood. In this book, an attempt is made to describe the theoretical prop erties of several stochastic adaptive search methods. Such a theoretical understanding may allow us to better predict algorithm performance and ultimately design new and improved algorithms. This book consolidates a collection of papers on the analysis and de velopment of stochastic adaptive search. The first chapter introduces random search algorithms. Chapters 2-5 describe the theoretical anal ysis of a progression of algorithms. A main result is that the expected number of iterations for pure adaptive search is linear in dimension for a class of Lipschitz global optimization problems. Chapter 6 discusses algorithms, based on the Hit-and-Run sampling method, that have been developed to approximate the ideal performance of pure random search. The final chapter discusses several applications in engineering that use stochastic adaptive search methods."

The scope of this volume is primarily to analyze from different methodological perspectives similar valuation and optimization problems arising in financial applications, aimed at facilitating a theoretical and computational integration between methods largely regarded as alternatives. Increasingly in recent years, financial management problems such as strategic asset allocation, asset-liability management, as well as asset pricing problems, have been presented in the literature adopting formulation and solution approaches rooted in stochastic programming, robust optimization, stochastic dynamic programming (including approximate SDP) methods, as well as policy rule optimization, heuristic approaches and others. The aim of the volume is to facilitate the comprehension of the modeling and methodological potentials of those methods, thus their common assumptions and peculiarities, relying on similar financial problems. The volume will address different valuation problems common in finance related to: asset pricing, optimal portfolio management, risk measurement, risk control and asset-liability management.The volume features chapters of theoretical and practical relevance clarifying recent advances in the associated applied field from different standpoints, relying on similar valuation problems and, as mentioned, facilitating a mutual and beneficial methodological and theoretical knowledge transfer. The distinctive aspects of the volume can be summarized as follows: Strong benchmarking philosophy, with contributors explicitly asked to underline current limits and desirable developments in their areas. Theoretical contributions, aimed at advancing the state-of-the-art in the given domain with a clear potential for applications The inclusion of an algorithmic-computational discussion of issues arising on similar valuation problems across different methods. Variety of applications: rarely is it possible within a single volume to consider and analyze different, and possibly competing, alternative optimization techniques applied to well-identified financial valuation problems. Clear definition of the current state-of-the-art in each methodological and applied area to facilitate future research directions.

Operations research and mathematical programming would not be as advanced today without the many advances in interior point methods during the last decade. These methods can now solve very efficiently and robustly large scale linear, nonlinear and combinatorial optimization problems that arise in various practical applications. The main ideas underlying interior point methods have influenced virtually all areas of mathematical programming including: analyzing and solving linear and nonlinear programming problems, sensitivity analysis, complexity analysis, the analysis of Newton's method, decomposition methods, polynomial approximation for combinatorial problems etc. This book covers the implications of interior techniques for the entire field of mathematical programming, bringing together many results in a uniform and coherent way. For the topics mentioned above the book provides theoretical as well as computational results, explains the intuition behind the main ideas, gives examples as well as proofs, and contains an extensive up-to-date bibliography. Audience: The book is intended for students, researchers and practitioners with a background in operations research, mathematics, mathematical programming, or statistics.

This book is the first easy-to-read text on nonsmooth optimization (NSO, not necessarily di erentiable optimization). Solving these kinds of problems plays a critical role in many industrial applications and real-world modeling systems, for example in the context of image denoising, optimal control, neural network training, data mining, economics and computational chemistry and physics. The book covers both the theory and the numerical methods used in NSO and provide an overview of di erent problems arising in the eld. It is organized into three parts:

1. convex and nonconvex analysis and the theory of NSO;

2. test problems and practical applications;

3. a guide to NSO software.The book is ideal for anyone teaching or attending NSO courses. As an accessible introduction to the eld, it is also well suited as an independent learning guide for practitioners already familiar with the basics of optimization."