This book is concerned with topological and differential properties of multivalued mappings and marginal functions. Beside this applica- tions to the sensitivity analysis of optimization problems, in particular nonlinear programming problems with perturbations, are studied. The elaborated methods are primarily obtained by theories and concepts of two former Soviet Union researchers, Demyanov and Rubinov. Con- sequently, a significant part of the presented results have never been published in English before. Based on the use of directional derivatives as a key tool in studying nonsmooth functions and multifunctions, these results can be considered as a further development of quasidifferential calculus created by Demyanov and Rubinov. In contrast to other research in this field, especially the recent publica- tion by Bonnans and Shapiro, this book analyses properties of marginal functions associated with optimization problems under quite general con- straints defined by means of multivalued mappings. A unified approach to directional differentiability of functions and multifunctions forms the base of the volume.

Recently, a great deal of progress has been made in the modeling and understanding of processes with nonlinear dynamics, even when only time series data are available. Modern reconstruction theory deals with creating nonlinear dynamical models from data and is at the heart of this improved understanding. Most of the work has been done by dynamicists, but for the subject to reach maturity, statisticians and signal processing engineers need to provide input both to the theory and to the practice. The book brings together different approaches to nonlinear time series analysis in order to begin a synthesis that will lead to better theory and practice in all the related areas. This book describes the state of the art in nonlinear dynamical reconstruction theory. The chapters are based upon a workshop held at the Isaac Newton Institute, Cambridge University, UK, in late 1998. The book's chapters present theory and methods topics by leading researchers in applied and theoretical nonlinear dynamics, statistics, probability, and systems theory. Features and topics: * disentangling uncertainty and error: the predictability of nonlinear systems * achieving good nonlinear models * delay reconstructions: dynamics vs. statistics * introduction to Monte Carlo Methods for Bayesian Data Analysis * latest results in extracting dynamical behavior via Markov Models * data compression, dynamics and stationarity Professionals, researchers, and advanced graduates in nonlinear dynamics, probability, optimization, and systems theory will find the book a useful resource and guide to current developments in the subject.

Recent years have witnessed important developments in those areas of the mathematical sciences where the basic model under study is a dynamical system such as a differential equation or control process. Many of these recent advances were made possible by parallel developments in nonlinear and nonsmooth analysis. The latter subjects, in general terms, encompass differential analysis and optimization theory in the absence of traditional linearity, convexity or smoothness assumptions. In the last three decades it has become increasingly recognized that nonlinear and nonsmooth behavior is naturally present and prevalent in dynamical models, and is therefore significant theoretically. This point of view has guided us in the organizational aspects of this ASI. Our goals were twofold: We intended to achieve "cross fertilization" between mathematicians who were working in a diverse range of problem areas, but who all shared an interest in nonlinear and nonsmooth analysis. More importantly, it was our goal to expose a young international audience (mainly graduate students and recent Ph. D. 's) to these important subjects. In that regard, there were heavy pedagogical demands placed upon the twelve speakers of the ASI, in meeting the needs of such a gathering. The talks, while exposing current areas of research activity, were required to be as introductory and comprehensive as possible. It is our belief that these goals were achieved, and that these proceedings bear this out. Each of the twelve speakers presented a mini-course of four or five hours duration.

Studies in generalized convexity and generalized monotonicity have significantly increased during the last two decades. Researchers with very diverse backgrounds such as mathematical programming, optimization theory, convex analysis, nonlinear analysis, nonsmooth analysis, linear algebra, probability theory, variational inequalities, game theory, economic theory, engineering, management science, equilibrium analysis, for example are attracted to this fast growing field of study. Such enormous research activity is partially due to the discovery of a rich, elegant and deep theory which provides a basis for interesting existing and potential applications in different disciplines. The handbook offers an advanced and broad overview of the current state of the field. It contains fourteen chapters written by the leading experts on the respective subject; eight on generalized convexity and the remaining six on generalized monotonicity.

The aim of the book is to cover the three fundamental aspects of research in equilibrium problems: the statement problem and its formulation using mainly variational methods, its theoretical solution by means of classical and new variational tools, the calculus of solutions and applications in concrete cases. The book shows how many equilibrium problems follow a general law (the so-called user equilibrium condition). Such law allows us to express the problem in terms of variational inequalities. Variational inequalities provide a powerful methodology, by which existence and calculation of the solution can be obtained.

This book contains refereed papers which were presented at the 34th Workshop of the International School of Mathematics "G. Stampacchia," the International Workshop on Optimization and Control with Applications. The book contains 28 papers that are grouped according to four broad topics: duality and optimality conditions, optimization algorithms, optimal control, and variational inequality and equilibrium problems. The specific topics covered in the individual chapters include optimal control, unconstrained and constrained optimization, complementarity and variational inequalities, equilibrium problems, semi-definite programs, semi-infinite programs, matrix functions and equations, nonsmooth optimization, generalized convexity and generalized monotinicity, and their applications.

Comprehensive and state-of-the art study of the basic concepts and principles of variational analysis and generalized differentiation in both finite-dimensional and infinite-dimensional spaces

Presents numerous applications to problems in the optimization, equilibria, stability and sensitivity, control theory, economics, mechanics, etc.

OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems addresses two increasingly important areas in GA implementation and practice. OmeGA, or the ordering messy genetic algorithm, combines some of the latest in competent GA technology to solve scheduling and other permutation problems. Competent GAs are those designed for principled solutions of hard problems, quickly, reliably, and accurately. Permutation and scheduling problems are difficult combinatorial optimization problems with commercial import across a variety of industries.

This book approaches both subjects systematically and clearly. The first part of the book presents the clearest description of messy GAs written to date along with an innovative adaptation of the method to ordering problems. The second part of the book investigates the algorithm on boundedly difficult test functions, showing principled scale up as problems become harder and longer. Finally, the book applies the algorithm to a test function drawn from the literature of scheduling.

The book deals with some of the fundamental issues of risk assessment in grid computing environments. The book describes the development of a hybrid probabilistic and possibilistic model for assessing the success of a computing task in a grid environment

This comprehensive work examines important recent developments and modern applications in the fields of optimization, control, game theory and equilibrium programming. In particular, the concepts of equilibrium and optimality are of immense practical importance affecting decision-making problems regarding policy and strategies, and in understanding and predicting systems in different application domains, ranging from economics and engineering to military applications. The book consists of 29 survey chapters written by distinguished researchers in the above areas.

In recent decades, it has become possible to turn the design process into computer algorithms. By applying different computer oriented methods the topology and shape of structures can be optimized and thus designs systematically improved. These possibilities have stimulated an interest in the mathematical foundations of structural optimization. The challenge of this book is to bridge a gap between a rigorous mathematical approach to variational problems and the practical use of algorithms of structural optimization in engineering applications. The foundations of structural optimization are presented in a sufficiently simple form to make them available for practical use and to allow their critical appraisal for improving and adapting these results to specific models. Special attention is to pay to the description of optimal structures of composites; to deal with this problem, novel mathematical methods of nonconvex calculus of variation are developed. The exposition is accompanied by examples.

At the heart of the topology of global optimization lies Morse Theory: The study of the behaviour of lower level sets of functions as the level varies. Roughly speaking, the topology of lower level sets only may change when passing a level which corresponds to a stationary point (or Karush-Kuhn Tucker point). We study elements of Morse Theory, both in the unconstrained and constrained case. Special attention is paid to the degree of differentiabil ity of the functions under consideration. The reader will become motivated to discuss the possible shapes and forms of functions that may possibly arise within a given problem framework. In a separate chapter we show how certain ideas may be carried over to nonsmooth items, such as problems of Chebyshev approximation type. We made this choice in order to show that a good under standing of regular smooth problems may lead to a straightforward treatment of "just" continuous problems by means of suitable perturbation techniques, taking a priori nonsmoothness into account. Moreover, we make a focal point analysis in order to emphasize the difference between inner product norms and, for example, the maximum norm. Then, specific tools from algebraic topol ogy, in particular homology theory, are treated in some detail. However, this development is carried out only as far as it is needed to understand the relation between critical points of a function on a manifold with structured boundary. Then, we pay attention to three important subjects in nonlinear optimization."

Whether costs are to be reduced, profits to be maximized, or scarce resources to be used wisely, optimization methods are available to guide decision making. In online optimization the main issue is incomplete data, and the scientific challenge: How well can an online algorithm perform? Can one guarantee solution quality, even without knowing all data in advance? In real-time optimization there is an additional requirement, decisions have to be computed very fast in relation to the time frame of the instance we consider. Online and real-time optimization problems occur in all branches of optimization. These areas have developed their own techniques but they are addressing the same issues: quality, stability, and robustness of the solutions. To fertilize this emerging topic of optimization theory and to foster cooperation between the different branches of optimization, the Deutsche Forschungsgemeinschaft (DFG) has supported a Priority Programme "Online Optimization of Large Systems".

Nonconvex Optimization is a multi-disciplinary research field that deals with the characterization and computation of local/global minima/maxima of nonlinear, nonconvex, nonsmooth, discrete and continuous functions. Nonconvex optimization problems are frequently encountered in modeling real world systems for a very broad range of applications including engineering, mathematical economics, management science, financial engineering, and social science. This contributed volume consists of selected contributions from the Advanced Training Programme on Nonconvex Optimization and Its Applications held at Banaras Hindu University in March 2009. It aims to bring together new concepts, theoretical developments, and applications from these researchers. Both theoretical and applied articles are contained in this volume which adds to the state of the art research in this field. Topics in Nonconvex Optimization is suitable for advanced graduate students and researchers in this area.

Decision makers in managerial and public organizations often encounter de cision problems under conflict or competition, because they select strategies independently or by mutual agreement and therefore their payoffs are then affected by the strategies of the other decision makers. Their interests do not always coincide and are at times even completely opposed. Competition or partial cooperation among decision makers should be considered as an essen tial part of the problem when we deal with the decision making problems in organizations which consist of decision makers with conflicting interests. Game theory has been dealing with such problems and its techniques have been used as powerful analytical tools in the resolution process of the decision problems. The publication of the great work by J. von Neumann and O. Morgen stern in 1944 attracted attention of many people and laid the foundation of game theory. We can see remarkable advances in the field of game theory for analysis of economic situations and a number of books in the field have been published in recent years. The aim of game theory is to specify the behavior of each player so as to optimize the interests of the player. It then recommends a set of solutions as strategies so that the actions chosen by each decision maker (player) lead to an outcome most profitable for himself or her self."

Two prisoners are told that they will be brought to a room and seated so that each can see the other. Hats will be placed on their heads; each hat is either red or green. The two prisoners must simultaneously submit a guess of their own hat color, and they both go free if at least one of them guesses correctly. While no communication is allowed once the hats have been placed, they will, however, be allowed to have a strategy session before being brought to the room. Is there a strategy ensuring their release? The answer turns out to be yes, and this is the simplest non-trivial example of a hat problem.

This book deals with the question of how successfully one can predict the value of an arbitrary function at one or more points of its domain based on some knowledge of its values at other points. Topics range from hat problems that are accessible to everyone willing to think hard, to some advanced topics in set theory and infinitary combinatorics. For example, there is a method of predicting the value "f"("a") of a function f mapping the reals to the reals, based only on knowledge of "f"'s values on the open interval ("a" 1, "a"), and for every such function the prediction is incorrect only on a countable set that is nowhere dense.

The monograph progresses from topics requiring fewer prerequisites to those requiring more, with most of the text being accessible to any graduate student in mathematics. The broad range of readership includes researchers, postdocs, and graduate students in the fields of set theory, mathematical logic, and combinatorics. The hope is that this book will bring together mathematicians from different areas to think about set theory via a very broad array of coordinated inference problems. "

This book introduces readers to the "Jaya" algorithm, an advanced optimization technique that can be applied to many physical and engineering systems. It describes the algorithm, discusses its differences with other advanced optimization techniques, and examines the applications of versions of the algorithm in mechanical, thermal, manufacturing, electrical, computer, civil and structural engineering. In real complex optimization problems, the number of parameters to be optimized can be very large and their influence on the goal function can be very complicated and nonlinear in character. Such problems cannot be solved using classical methods and advanced optimization methods need to be applied. The Jaya algorithm is an algorithm-specific parameter-less algorithm that builds on other advanced optimization techniques. The application of Jaya in several engineering disciplines is critically assessed and its success compared with other complex optimization techniques such as Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE), Artificial Bee Colony (ABC), and other recently developed algorithms.

This collection of papers is an outgrowth of the "Game Practice I" th th conference held in Genoa from 28 to 30 June 1998. More precisely, it is the result of the call for papers that was issued in association with that conference: actually, nearly half of the contributions to this book are papers that were presented in Genoa. The name chosen for the conference and for this book is in evident and provocative contrast with "Game Theory" this choice needs some explanation, and to that we shall devote a few words of this Preface. Let us say at the outset that "Game Practice" would not exist without Game Theory. As one can see, the overall content of this book is firmly rooted in the existing Game Theory. It could be hardly otherwise, given the success and influence of Game Theory (just think of the basic issues in Economic Theory), and the tremendous development that has taken place within Game Theory. This success, however, makes even more evident the existence of problems with respect to the verification of the theory. This is patent from the point of view of the predictive value of Game Theory (the "positive" side): a lot of experimental and observational evidence demon strates that there is a large gap between theory and "practice.""

Many social or economic conflict situations can be modeled by specifying the alternatives on which the involved parties may agree, and a special alternative which summarizes what happens in the event that no agreement is reached. Such a model is called a bargaining game, and a prescription assigning an alternative to each bargaining game is called a bargaining solution. In the cooperative game-theoretical approach, bargaining solutions are mathematically characterized by desirable properties, usually called axioms. In the noncooperative approach, solutions are derived as equilibria of strategic models describing an underlying bargaining procedure. Axiomatic Bargaining Game Theory provides the reader with an up-to-date survey of cooperative, axiomatic models of bargaining, starting with Nash's seminal paper, The Bargaining Problem. It presents an overview of the main results in this area during the past four decades. Axiomatic Bargaining Game Theory provides a chapter on noncooperative models of bargaining, in particular on those models leading to bargaining solutions that also result from the axiomatic approach. The main existing axiomatizations of solutions for coalitional bargaining games are included, as well as an auxiliary chapter on the relevant demands from utility theory.

With the ever increasing growth of services and the corresponding demand for Quality of Service requirements that are placed on IP-based networks, the essential aspects of network planning will be critical in the coming years. A wide number of problems must be faced in order for the next generation of IP networks to meet their expected performance. With Performance Evaluation and Planning Methods for the Next Generation Internet, the editors have prepared a volume that outlines and illustrates these developing trends.

A number of the problems examined and analyzed in the book are:

-The design of IP networks and guaranteed performance

-Performances of virtual private networks

-Network design and reliability

-The issues of pricing, routing and the management of QoS

-Design problems arising from wireless networks

-Controlling network congestion

-New applications spawned from Internet use

-Several new models are introduced that will lead to better Internet performance

These are a few of the problem areas addressed in the book and only a selective example of some of the coming key areas in networks requiring performance evaluation and network planning.

This textbook gives a comprehensive introduction to stochastic processes and calculus in the fields of finance and economics, more specifically mathematical finance and time series econometrics. Over the past decades stochastic calculus and processes have gained great importance, because they play a decisive role in the modeling of financial markets and as a basis for modern time series econometrics. Mathematical theory is applied to solve stochastic differential equations and to derive limiting results for statistical inference on nonstationary processes. This introduction is elementary and rigorous at the same time. On the one hand it gives a basic and illustrative presentation of the relevant topics without using many technical derivations. On the other hand many of the procedures are presented at a technically advanced level: for a thorough understanding, they are to be proven. In order to meet both requirements jointly, the present book is equipped with a lot of challenging problems at the end of each chapter as well as with the corresponding detailed solutions. Thus the virtual text - augmented with more than 60 basic examples and 40 illustrative figures - is rather easy to read while a part of the technical arguments is transferred to the exercise problems and their solutions.

It was in the middle of the 1980s, when the seminal paper by Kar markar opened a new epoch in nonlinear optimization. The importance of this paper, containing a new polynomial-time algorithm for linear op timization problems, was not only in its complexity bound. At that time, the most surprising feature of this algorithm was that the theoretical pre diction of its high efficiency was supported by excellent computational results. This unusual fact dramatically changed the style and direc tions of the research in nonlinear optimization. Thereafter it became more and more common that the new methods were provided with a complexity analysis, which was considered a better justification of their efficiency than computational experiments. In a new rapidly develop ing field, which got the name "polynomial-time interior-point methods", such a justification was obligatory. Afteralmost fifteen years of intensive research, the main results of this development started to appear in monographs [12, 14, 16, 17, 18, 19]. Approximately at that time the author was asked to prepare a new course on nonlinear optimization for graduate students. The idea was to create a course which would reflect the new developments in the field. Actually, this was a major challenge. At the time only the theory of interior-point methods for linear optimization was polished enough to be explained to students. The general theory of self-concordant functions had appeared in print only once in the form of research monograph [12].

As optimization researchers tackle larger and larger problems, scale interactions play an increasingly important role. One general strategy for dealing with a large or difficult problem is to partition it into smaller ones, which are hopefully much easier to solve, and then work backwards towards the solution of original problem, using a solution from a previous level as a starting guess at the next level. This volume contains 22 chapters highlighting some recent research. The topics of the chapters selected for this volume are focused on the development of new solution methodologies, including general multilevel solution techniques, for tackling difficult, large-scale optimization problems that arise in science and industry. Applications presented in the book include but are not limited to the circuit placement problem in VLSI design, a wireless sensor location problem, optimal dosages in the treatment of cancer by radiation therapy, and facility location.

V-INVEX FUNCTIONS AND VECTOR OPTIMIZATION summarizes and synthesizes an aspect of research work that has been done in the area of Generalized Convexity over the past several decades. Specifically, the book focuses on V-invex functions in vector optimization that have grown out of the work of Jeyakumar and Mond in the 1990?s. V-invex functions are areas in which there has been much interest because it allows researchers and practitioners to address and provide better solutions to problems that are nonlinear, multi-objective, fractional, and continuous in nature. Hence, V-invex functions have permitted work on a whole new class of vector optimization applications. There has been considerable work on vector optimization by some highly distinguished researchers including Kuhn, Tucker, Geoffrion, Mangasarian, Von Neuman, Schaiible, Ziemba, etc. The authors have integrated this related research into their book and demonstrate the wide context from which the area has grown and continues to grow. The result is a well-synthesized, accessible, and usable treatment for students, researchers, and practitioners in the areas of OR, optimization, applied mathematics, engineering, and their work relating to a wide range of problems which include financial institutions, logistics, transportation, traffic management, etc.