The purpose of this contributed volume is to provide a primary resource for anyone interested in fixed point theory with a metric flavor. The book presents information for those wishing to find results that might apply to their own work and for those wishing to obtain a deeper understanding of the theory. The book should be of interest to a wide range of researchers in mathematical analysis as well as to those whose primary interest is the study of fixed point theory and the underlying spaces. The level of exposition is directed to a wide audience, including students and established researchers. Key topics covered include Banach contraction theorem, hyperconvex metric spaces, modular function spaces, fixed point theory in ordered sets, topological fixed point theory for set-valued maps, coincidence theorems, Lefschetz and Nielsen theories, systems of nonlinear inequalities, iterative methods for fixed point problems, and the Ekeland's variational principle.

This volume compiles the major results of conference participants from the "Third International Conference in Network Analysis" held at the Higher School of Economics, Nizhny Novgorod in May 2013, with the aim to initiate further joint research among different groups. The contributions in this book cover a broad range of topics relevant to the theory and practice of network analysis, including the reliability of complex networks, software, theory, methodology, and applications. Network analysis has become a major research topic over the last several years. The broad range of applications that can be described and analyzed by means of a network has brought together researchers, practitioners from numerous fields such as operations research, computer science, transportation, energy, biomedicine, computational neuroscience and social sciences. In addition, new approaches and computer environments such as parallel computing, grid computing, cloud computing, and quantum computing have helped to solve large scale network optimization problems.

This book presents a modular and expandable technique in the rapidly emerging research area of automatic configuration and selection of the best algorithm for the instance at hand. The author presents the basic model behind ISAC and then details a number of modifications and practical applications. In particular, he addresses automated feature generation, offline algorithm configuration for portfolio generation, algorithm selection, adaptive solvers, online tuning, and parallelization. The author's related thesis was honorably mentioned (runner-up) for the ACP Dissertation Award in 2014, and this book includes some expanded sections and notes on recent developments. Additionally, the techniques described in this book have been successfully applied to a number of solvers competing in the SAT and MaxSAT International Competitions, winning a total of 18 gold medals between 2011 and 2014. The book will be of interest to researchers and practitioners in artificial intelligence, in particular in the area of machine learning and constraint programming.

This book surveys key algorithm developments between 1990 and 2012, with brief descriptions, a unified pseudocode for each algorithm and downloadable program code. Provides a taxonomy to clarify similarities and differences as well as historical relationships.

Metaheuristics, and evolutionary algorithms in particular, are known to provide efficient, adaptable solutions for many real-world problems, but the often informal way in which they are defined and applied has led to misconceptions, and even successful applications are sometimes the outcome of trial and error. Ideally, theoretical studies should explain when and why metaheuristics work, but the challenge is huge: mathematical analysis requires significant effort even for simple scenarios and real-life problems are usually quite complex. In this book the editors establish a bridge between theory and practice, presenting principled methods that incorporate problem knowledge in evolutionary algorithms and other metaheuristics. The book consists of 11 chapters dealing with the following topics: theoretical results that show what is not possible, an assessment of unsuccessful lines of empirical research; methods for rigorously defining the appropriate scope of problems while acknowledging the compromise between the class of problems to which a search algorithm is applied and its overall expected performance; the top-down principled design of search algorithms, in particular showing that it is possible to design algorithms that are provably good for some rigorously defined classes; and, finally, principled practice, that is reasoned and systematic approaches to setting up experiments, metaheuristic adaptation to specific problems, and setting parameters. With contributions by some of the leading researchers in this domain, this book will be of significant value to scientists, practitioners, and graduate students in the areas of evolutionary computing, metaheuristics, and computational intelligence.

The book presents, in a systematic manner, the optimal controls under different mathematical models in fermentation processes. Variant mathematical models - i.e., those for multistage systems; switched autonomous systems; time-dependent and state-dependent switched systems; multistage time-delay systems and switched time-delay systems - for fed-batch fermentation processes are proposed and the theories and algorithms of their optimal control problems are studied and discussed. By putting forward novel methods and innovative tools, the book provides a state-of-the-art and comprehensive systematic treatment of optimal control problems arising in fermentation processes. It not only develops nonlinear dynamical system, optimal control theory and optimization algorithms, but can also help to increase productivity and provide valuable reference material on commercial fermentation processes.

Nature-inspired algorithms such as cuckoo search and firefly algorithm have become popular and widely used in recent years in many applications. These algorithms are flexible, efficient and easy to implement. New progress has been made in the last few years, and it is timely to summarize the latest developments of cuckoo search and firefly algorithm and their diverse applications. This book will review both theoretical studies and applications with detailed algorithm analysis, implementation and case studies so that readers can benefit most from this book. Application topics are contributed by many leading experts in the field. Topics include cuckoo search, firefly algorithm, algorithm analysis, feature selection, image processing, travelling salesman problem, neural network, GPU optimization, scheduling, queuing, multi-objective manufacturing optimization, semantic web service, shape optimization, and others. This book can serve as an ideal reference for both graduates and researchers in computer science, evolutionary computing, machine learning, computational intelligence, and optimization, as well as engineers in business intelligence, knowledge management and information technology.  

Written by an international group of active researchers in the field, this volume presents innovative formulations and applied procedures for sensitivity analysis and structural design optimization. Eight chapters discuss subjects ranging from recent developments in the determination and application of topological gradients, to the use of evolutionary algorithms and meta-models to solve practical engineering problems. With such a comprehensive set of contributions, the book is a valuable source of information for graduate students and researchers entering or working in the matter.

This volume presents significant advances in a number of theories and problems of Mathematical Analysis and its applications in disciplines such as Analytic Inequalities, Operator Theory, Functional Analysis, Approximation Theory, Functional Equations, Differential Equations, Wavelets, Discrete Mathematics and Mechanics. The contributions focus on recent developments and are written by eminent scientists from the international mathematical community. Special emphasis is given to new results that have been obtained in the above mentioned disciplines in which Nonlinear Analysis plays a central role. Some review papers published in this volume will be particularly useful for a broader readership in Mathematical Analysis, as well as for graduate students. An attempt is given to present all subjects in this volume in a unified and self-contained manner, to be particularly useful to the mathematical community.

This book opens new avenues in understanding mathematical models within the context of a transition economy. The exposition lays out the methods for combining different mathematical structures and tools to effectively build the next model that will accurately reflect real world economic processes. Mathematical modeling of weather phenomena allows us to forecast certain essential weather parameters without any possibility of changing them. By contrast, modeling of transition economies gives us the freedom to not only predict changes in important indexes of all types of economies, but also to influence them more effectively in the desired direction. Simply put: any economy, including a transitional one, can be controlled. This book is useful to anyone who wants to increase profits within their business, or improve the quality of their family life and the economic area they live in. It is beneficial for undergraduate and graduate students specializing in the fields of Economic Informatics, Economic Cybernetics, Applied Mathematics and Large Information Systems, as well as for professional economists, and employees of state planning and statistical organizations.

This book is comprised of selected research articles developed from a workshop on Ergodic Theory, Probabilistic Methods and Applications, held in April 2012 at the Banff International Research Station. It contains contributions from world leading experts in ergodic theory, numerical dynamical systems, molecular dynamics and ocean/atmosphere dynamics, nonequilibrium statistical mechanics. The volume will serve as a valuable reference for mathematicians, physicists, engineers, biologists and climate scientists, who currently use, or wish to learn how to use, probabilistic techniques to cope with dynamical models that display open or non-equilibrium behavior.

The aim of this book is to present qualitative aspects of logistics operations and supply chain management which help to implement the sustainable policy principles in the companies and public sector’s institutions. Authors in individual chapters address the issues related to reverse network configuration, forward and reverse supply chain integration, CO2 reduction in transportation, improvement of the  production operations and management of the recovery activities. Some best practices from different countries and industries are presented. This book will be valuable to both academics and practitioners wishing to deepen their knowledge in the field of logistics operations and management with regard to sustainability issues.

This book honours the outstanding contributions of Vladimir Vapnik, a rare example of a scientist for whom the following statements hold true simultaneously: his work led to the inception of a new field of research, the theory of statistical learning and empirical inference; he has lived to see the field blossom; and he is still as active as ever. He started analyzing learning algorithms in the 1960s and he invented the first version of the generalized portrait algorithm. He later developed one of the most successful methods in machine learning, the support vector machine (SVM) - more than just an algorithm, this was a new approach to learning problems, pioneering the use of functional analysis and convex optimization in machine learning. Part I of this book contains three chapters describing and witnessing some of Vladimir Vapnik's contributions to science. In the first chapter, Leon Bottou discusses the seminal paper published in 1968 by Vapnik and Chervonenkis that lay the foundations of statistical learning theory, and the second chapter is an English-language translation of that original paper. In the third chapter, Alexey Chervonenkis presents a first-hand account of the early history of SVMs and valuable insights into the first steps in the development of the SVM in the framework of the generalised portrait method. The remaining chapters, by leading scientists in domains such as statistics, theoretical computer science, and mathematics, address substantial topics in the theory and practice of statistical learning theory, including SVMs and other kernel-based methods, boosting, PAC-Bayesian theory, online and transductive learning, loss functions, learnable function classes, notions of complexity for function classes, multitask learning, and hypothesis selection. These contributions include historical and context notes, short surveys, and comments on future research directions. This book will be of interest to researchers, engineers, and graduate students engaged with all aspects of statistical learning.

This book provides an overview of state-of-the-art research on “Systems and Optimization Aspects of Smart Grid Challenges.� The authors have compiled and integrated different aspects of applied systems optimization research to smart grids, and also describe some of its critical challenges and requirements. The promise of a smarter electricity grid could significantly change how consumers use and pay for their electrical power, and could fundamentally reshape the current Industry. Gaining increasing interest and acceptance, Smart Grid technologies combine power generation and delivery systems with advanced communication systems to help save energy, reduce energy costs and improve reliability. Taken together, these technologies support new approaches for load balancing and power distribution, allowing optimal runtime power routing and cost management. Such unprecedented capabilities, however, also present a set of new problems and challenges at the technical and regulatory levels that must be addressed by Industry and the Research Community.

Metaheuristics exhibit desirable properties like simplicity, easy parallelizability and ready applicability to different types of optimization problems such as real parameter optimization, combinatorial optimization and mixed integer optimization. They are thus beginning to play a key role in different industrially important process engineering applications, among them the synthesis of heat and mass exchange equipment, synthesis of distillation columns and static and dynamic optimization of chemical and bioreactors. This book explains cutting-edge research techniques in related computational intelligence domains and their applications in real-world process engineering. It will be of interest to industrial practitioners and research academics.

This book provides a short and concise introduction to Bayesian optimization specifically for experimental and computational materials scientists. After explaining the basic idea behind Bayesian optimization and some applications to materials science in Chapter 1, the mathematical theory of Bayesian optimization is outlined in Chapter 2. Finally, Chapter 3 discusses an application of Bayesian optimization to a complicated structure optimization problem in computational surface science.Bayesian optimization is a promising global optimization technique that originates in the field of machine learning and is starting to gain attention in materials science. For the purpose of materials design, Bayesian optimization can be used to predict new materials with novel properties without extensive screening of candidate materials. For the purpose of computational materials science, Bayesian optimization can be incorporated into first-principles calculations to perform efficient, global structure optimizations. While research in these directions has been reported in high-profile journals, until now there has been no textbook aimed specifically at materials scientists who wish to incorporate Bayesian optimization into their own research. This book will be accessible to researchers and students in materials science who have a basic background in calculus and linear algebra.

Many of our daily-life problems can be written in the form of an optimization problem. Therefore, solution methods are needed to solve such problems. Due to the complexity of the problems, it is not always easy to find the exact solution. However, approximate solutions can be found. The theory of the best approximation is applicable in a variety of problems arising in nonlinear functional analysis and optimization. This book highlights interesting aspects of nonlinear analysis and optimization together with many applications in the areas of physical and social sciences including engineering. It is immensely helpful for young graduates and researchers who are pursuing research in this field, as it provides abundant research resources for researchers and post-doctoral fellows. This will be a valuable addition to the library of anyone who works in the field of applied mathematics, economics and engineering.

This book describes how evolutionary algorithms (EA), including genetic algorithms (GA) and particle swarm optimization (PSO) can be utilized for solving multi-objective optimization problems in the area of embedded and VLSI system design. Many complex engineering optimization problems can be modelled as multi-objective formulations. This book provides an introduction to multi-objective optimization using meta-heuristic algorithms, GA and PSO and how they can be applied to problems like hardware/software partitioning in embedded systems, circuit partitioning in VLSI, design of operational amplifiers in analog VLSI, design space exploration in high-level synthesis, delay fault testing in VLSI testing and scheduling in heterogeneous distributed systems. It is shown how, in each case, the various aspects of the EA, namely its representation and operators like crossover, mutation, etc, can be separately formulated to solve these problems. This book is intended for design engineers and researchers in the field of VLSI and embedded system design. The book introduces the multi-objective GA and PSO in a simple and easily understandable way that will appeal to introductory readers.

This is the first comprehensive introduction to the powerful moment approach for solving global optimization problems (and some related problems) described by polynomials (and even semi-algebraic functions). In particular, the author explains how to use relatively recent results from real algebraic geometry to provide a systematic numerical scheme for computing the optimal value and global minimizers. Indeed, among other things, powerful positivity certificates from real algebraic geometry allow one to define an appropriate hierarchy of semidefinite (SOS) relaxations or LP relaxations whose optimal values converge to the global minimum. Several extensions to related optimization problems are also described. Graduate students, engineers and researchers entering the field can use this book to understand, experiment with and master this new approach through the simple worked examples provided.

This is the first comprehensive introduction to the powerful moment approach for solving global optimization problems (and some related problems) described by polynomials (and even semi-algebraic functions). In particular, the author explains how to use relatively recent results from real algebraic geometry to provide a systematic numerical scheme for computing the optimal value and global minimizers. Indeed, among other things, powerful positivity certificates from real algebraic geometry allow one to define an appropriate hierarchy of semidefinite (SOS) relaxations or LP relaxations whose optimal values converge to the global minimum. Several extensions to related optimization problems are also described. Graduate students, engineers and researchers entering the field can use this book to understand, experiment with and master this new approach through the simple worked examples provided.

This book deals with optimization methods as tools for decision making and control in the presence of model uncertainty. It is oriented to the use of these tools in engineering, specifically in automatic control design with all its components: analysis of dynamical systems, identification problems, and feedback control design. Developments in Model-Based Optimization and Control takes advantage of optimization-based formulations for such classical feedback design objectives as stability, performance and feasibility, afforded by the established body of results and methodologies constituting optimal control theory. It makes particular use of the popular formulation known as predictive control or receding-horizon optimization. The individual contributions in this volume are wide-ranging in subject matter but coordinated within a five-part structure covering material on: * complexity and structure in model predictive control (MPC); * collaborative MPC; * distributed MPC; * optimization-based analysis and design; and * applications to bioprocesses, multivehicle systems or energy management. The various contributions cover a subject spectrum including inverse optimality and more modern decentralized and cooperative formulations of receding-horizon optimal control. Readers will find fourteen chapters dedicated to optimization-based tools for robustness analysis, and decision-making in relation to feedback mechanisms-fault detection, for example-and three chapters putting forward applications where the model-based optimization brings a novel perspective. Developments in Model-Based Optimization and Control is a selection of contributions expanded and updated from the Optimisation-based Control and Estimation workshops held in November 2013 and November 2014. It forms a useful resource for academic researchers and graduate students interested in the state of the art in predictive control. Control engineers working in model-based optimization and control, particularly in its bioprocess applications will also find this collection instructive.

The focus of the present volume is stochastic optimization of dynamical systems in discrete time where - by concentrating on the role of information regarding optimization problems - it discusses the related discretization issues. There is a growing need to tackle uncertainty in applications of optimization. For example the massive introduction of renewable energies in power systems challenges traditional ways to manage them. This book lays out basic and advanced tools to handle and numerically solve such problems and thereby is building a bridge between Stochastic Programming and Stochastic Control. It is intended for graduates readers and scholars in optimization or stochastic control, as well as engineers with a background in applied mathematics.

Very little has been published on optimization of pharmaceutical portfolios. Moreover, most of published literature is coming from the commercial side, where probability of technical success (PoS) is treated as fixed, and not as a consequence of development strategy or design. In this book there is a strong focus on impact of study design on PoS and ultimately on the value of portfolio. Design options that are discussed in different chapters are dose-selection strategies, adaptive design and enrichment. Some development strategies that are discussed are indication sequencing, optimal number of programs and optimal decision criteria. This book includes chapters written by authors with very broad backgrounds including financial, clinical, statistical, decision sciences, commercial and regulatory. Many authors have long held executive positions and have been involved with decision making at a product or at a portfolio level. As such, it is expected that this book will attract a very broad audience, including decision makers in pharmaceutical R&D, commercial and financial departments. The intended audience also includes portfolio planners and managers, statisticians, decision scientists and clinicians. Early chapters describe approaches to portfolio optimization from big Pharma and Venture Capital standpoints. They have stronger focus on finances and processes. Later chapters present selected statistical and decision analysis methods for optimizing drug development programs and portfolios. Some methodological chapters are technical; however, with a few exceptions they require a relatively basic knowledge of statistics by a reader.

This book is the first easy-to-read text on nonsmooth optimization (NSO, not necessarily differentiable 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 different problems arising in the field. 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 field, it is also well suited as an independent learning guide for practitioners already familiar with the basics of optimization.

This book presents the latest findings on stochastic dynamic programming models and on solving optimal control problems in networks. It includes the authors' new findings on determining the optimal solution of discrete optimal control problems in networks and on solving game variants of Markov decision problems in the context of computational networks. First, the book studies the finite state space of Markov processes and reviews the existing methods and algorithms for determining the main characteristics in Markov chains, before proposing new approaches based on dynamic programming and combinatorial methods. Chapter two is dedicated to infinite horizon stochastic discrete optimal control models and Markov decision problems with average and expected total discounted optimization criteria, while Chapter three develops a special game-theoretical approach to Markov decision processes and stochastic discrete optimal control problems. In closing, the book's final chapter is devoted to finite horizon stochastic control problems and Markov decision processes. The algorithms developed represent a valuable contribution to the important field of computational network theory.