The book is intended for graduate students and researchers in mathematics, computer science, and operational research. The book presents a new derivative-free optimization method/algorithm based on randomly generated trial points in specified domains and where the best ones are selected at each iteration by using a number of rules. This method is different from many other well established methods presented in the literature and proves to be competitive for solving many unconstrained optimization problems with different structures and complexities, with a relative large number of variables. Intensive numerical experiments with 140 unconstrained optimization problems, with up to 500 variables, have shown that this approach is efficient and robust. Structured into 4 chapters, Chapter 1 is introductory. Chapter 2 is dedicated to presenting a two level derivative-free random search method for unconstrained optimization. It is assumed that the minimizing function is continuous, lower bounded and its minimum value is known. Chapter 3 proves the convergence of the algorithm. In Chapter 4, the numerical performances of the algorithm are shown for solving 140 unconstrained optimization problems, out of which 16 are real applications. This shows that the optimization process has two phases: the reduction phase and the stalling one. Finally, the performances of the algorithm for solving a number of 30 large-scale unconstrained optimization problems up to 500 variables are presented. These numerical results show that this approach based on the two level random search method for unconstrained optimization is able to solve a large diversity of problems with different structures and complexities. There are a number of open problems which refer to the following aspects: the selection of the number of trial or the number of the local trial points, the selection of the bounds of the domains where the trial points and the local trial points are randomly generated and a criterion for initiating the line search.

A fun and stunningly illustrated introduction to the art of linear optimization Linear optimization is a powerful modeling method for discovering the best solution to a problem among a set of available alternatives. It is one of today's most important branches of mathematics and computer science-and also a surprisingly rich medium for creating breathtaking works of art. Opt Art takes readers on an entertaining tour of linear optimization and its applications, showing along the way how it can be used to design visual art. Robert Bosch provides a lively and accessible introduction to the geometric, algebraic, and algorithmic foundations of optimization. He presents classical applications, such as the legendary Traveling Salesman Problem, and shows how to adapt them to make optimization art-opt art. Each chapter in this marvelously illustrated book begins with a problem or puzzle and demonstrates how the solution can be derived using a host of artistic methods and media, including 3D printing, laser cutting, and computer-controlled machining. Bosch focuses on mathematical modeling throughout-converting a problem into a workable mathematical form, solving it using optimization techniques, and examining the results, which can take the form of mosaics, line drawings, and even sculpture. All you need is some high-school algebra, geometry, and calculus to follow along. Featuring more than a hundred illustrations and photos of Bosch's own art, Opt Art demonstrates how mathematics and computing can be used to create beauty and express emotion through amazing works of art.

This Springer brief addresses the challenges encountered in the study of the optimization of time-nonhomogeneous Markov chains. It develops new insights and new methodologies for systems in which concepts such as stationarity, ergodicity, periodicity and connectivity do not apply. This brief introduces the novel concept of confluencity and applies a relative optimization approach. It develops a comprehensive theory for optimization of the long-run average of time-nonhomogeneous Markov chains. The book shows that confluencity is the most fundamental concept in optimization, and that relative optimization is more suitable for treating the systems under consideration than standard ideas of dynamic programming. Using confluencity and relative optimization, the author classifies states as confluent or branching and shows how the under-selectivity issue of the long-run average can be easily addressed, multi-class optimization implemented, and Nth biases and Blackwell optimality conditions derived. These results are presented in a book for the first time and so may enhance the understanding of optimization and motivate new research ideas in the area.

This volume covers contemporary aspects of geometric measure theory with a focus on applications to partial differential equations, free boundary problems and water waves. It is based on lectures given at the 2019 CIME summer school "Geometric Measure Theory and Applications - From Geometric Analysis to Free Boundary Problems" which took place in Cetraro, Italy, under the scientific direction of Matteo Focardi and Emanuele Spadaro. Providing a description of the structure of measures satisfying certain differential constraints, and covering regularity theory for Bernoulli type free boundary problems and water waves as well as regularity theory for the obstacle problems and the developments leading to applications to the Stefan problem, this volume will be of interest to students and researchers in mathematical analysis and its applications.

Solving nonsmooth optimization (NSO) problems is critical in many practical applications and real-world modeling systems. The aim of this book is to survey various numerical methods for solving NSO problems and to provide an overview of the latest developments in the field. Experts from around the world share their perspectives on specific aspects of numerical NSO. The book is divided into four parts, the first of which considers general methods including subgradient, bundle and gradient sampling methods. In turn, the second focuses on methods that exploit the problem's special structure, e.g. algorithms for nonsmooth DC programming, VU decomposition techniques, and algorithms for minimax and piecewise differentiable problems. The third part considers methods for special problems like multiobjective and mixed integer NSO, and problems involving inexact data, while the last part highlights the latest advancements in derivative-free NSO. Given its scope, the book is ideal for students attending courses on numerical nonsmooth optimization, for lecturers who teach optimization courses, and for practitioners who apply nonsmooth optimization methods in engineering, artificial intelligence, machine learning, and business. Furthermore, it can serve as a reference text for experts dealing with nonsmooth optimization.

This book presents the state of the art in designing high-performance algorithms that combine simulation and optimization in order to solve complex optimization problems in science and industry, problems that involve time-consuming simulations and expensive multi-objective function evaluations. As traditional optimization approaches are not applicable per se, combinations of computational intelligence, machine learning, and high-performance computing methods are popular solutions. But finding a suitable method is a challenging task, because numerous approaches have been proposed in this highly dynamic field of research. That's where this book comes in: It covers both theory and practice, drawing on the real-world insights gained by the contributing authors, all of whom are leading researchers. Given its scope, if offers a comprehensive reference guide for researchers, practitioners, and advanced-level students interested in using computational intelligence and machine learning to solve expensive optimization problems.

This book provides a detailed understanding of optimization methods as they are implemented in a variety of manufacturing, fabrication and machining processes. It covers the implementation of statistical methods, multi-criteria decision making methods and evolutionary techniques for single and multi-objective optimization to improve quality, productivity, and sustainability in manufacturing. It reports on the theoretical aspects, special features, recent research and latest development in the field. Optimization of Manufacturing Processes is a valuable source of information for researchers and practitioners, as it fills the gap where no dedicated book is available on intelligent manufacturing/modeling and optimization in manufacturing. Readers will develop an understanding of the implementation of statistical and evolutionary techniques for modeling and optimization in manufacturing.

This monograph presents new theories and methods for fixed-time cooperative control of multi-agent systems. Fundamental concepts of fixed-time stability and stabilization are introduced with insightful understanding. This book presents solutions for several problems of fixed-time cooperative control using systematic design methods. The book compares fixed-time cooperative control with asymptotic cooperative control, demonstrating how the former can achieve better closed-loop performance and disturbance rejection properties. It also discusses the differences from finite-time control, and shows how fixed-time cooperative control can produce the faster rate of convergence and provide an explicit estimate of the settling time independent of initial conditions. This monograph presents multiple applications of fixed-time control schemes, including to distributed optimization of multi-agent systems, making it useful to students, researchers and engineers alike.

This proceedings provides novel concepts and techniques for air traffic management (ATM) and communications, navigation, and surveillance (CNS) systems. The volume consists of selected papers from the 5th ENRI International Workshop on ATM/CNS (EIWAC2017) held in Tokyo in November 2017, the theme of which was "Drafting Future Skies". Included are key topics to realize safer and more efficient skies in the future, linked to the integrated conference theme consisting of long-term visions based on presentations from various fields. The proceedings is dedicated not only to researchers, academicians, and university students, but also to engineers in the industry, air navigation service providers (ANSPs), and regulators of aviation.

This book presents a novel framework, known as Active Robust Optimization, which provides the tools for evaluating, comparing and optimizing changeable products. Since any product that can change its configuration during normal operation may be considered a "changeable product," the framework is widely applicable. Further, the methodology enables designers to use adaptability to deal with uncertainties and so avoid over-conservative designs. Offering a comprehensive overview of the framework, including its unique features, such as its ability to optimally respond to uncertain situations, the book also defines a new class of optimization problem and examines the effects of changes in various parameters on their solution. Lastly, it discusses innovative approaches for solving the problem and demonstrates these with two examples from different fields in engineering design: optimization of an optical table and optimization of a gearbox.

This book offers a rigorous mathematical analysis of fuzzy geometrical ideas. It demonstrates the use of fuzzy points for interpreting an imprecise location and for representing an imprecise line by a fuzzy line. Further, it shows that a fuzzy circle can be used to represent a circle when its description is not known precisely, and that fuzzy conic sections can be used to describe imprecise conic sections. Moreover, it discusses fundamental notions on fuzzy geometry, including the concepts of fuzzy line segment and fuzzy distance, as well as key fuzzy operations, and includes several diagrams and numerical illustrations to make the topic more understandable. The book fills an important gap in the literature, providing the first comprehensive reference guide on the fuzzy mathematics of imprecise image subsets and imprecise geometrical objects. Mainly intended for researchers active in fuzzy optimization, it also includes chapters relevant for those working on fuzzy image processing and pattern recognition. Furthermore, it is a valuable resource for beginners interested in basic operations on fuzzy numbers, and can be used in university courses on fuzzy geometry, dealing with imprecise locations, imprecise lines, imprecise circles, and imprecise conic sections.

This proceedings presents the result of the 8th International Conference in Network Analysis, held at the Higher School of Economics, Moscow, in May 2018. The conference brought together scientists, engineers, and researchers from academia, industry, and government. Contributions in this book focus on the development of network algorithms for data mining and its applications. Researchers and students in mathematics, economics, statistics, computer science, and engineering find this collection a valuable resource filled with the latest research in network analysis. Computational aspects and applications of large-scale networks in market models, neural networks, social networks, power transmission grids, maximum clique problem, telecommunication networks, and complexity graphs are included with new tools for efficient network analysis of large-scale networks. Machine learning techniques in network settings including community detection, clustering, and biclustering algorithms are presented with applications to social network analysis.

This book highlights recent advances in the field of districting, territory design, and zone design. Districting problems deal essentially with tactical decisions, and involve mainly dividing a set of geographic units into clusters or territories subject to some planning requirements. This book presents models, theory, algorithms (exact or heuristic), and applications that would bring research on districting systems up-to-date and define the state-of-the-art. Although papers have addressed real-world problems that require districting or territory division decisions, this is the first comprehensive book that directly addresses these problems. The chapters capture the diverse nature of districting applications, as the book is divided into three different areas of research. Part I covers recent up-to-date surveys on important areas of districting such as police districting, health care districting, and districting algorithms based on computational geometry. Part II focuses on recent advances on theory, modeling, and algorithms including mathematical programming and heuristic approaches, and finally, Part III contains successful applications in real-world districting cases.

The book is devoted to the study of approximate solutions of optimization problems in the presence of computational errors. It contains a number of results on the convergence behavior of algorithms in a Hilbert space, which are known as important tools for solving optimization problems. The research presented in the book is the continuation and the further development of the author's (c) 2016 book Numerical Optimization with Computational Errors, Springer 2016. Both books study the algorithms taking into account computational errors which are always present in practice. The main goal is, for a known computational error, to find out what an approximate solution can be obtained and how many iterates one needs for this. The main difference between this new book and the 2016 book is that in this present book the discussion takes into consideration the fact that for every algorithm, its iteration consists of several steps and that computational errors for different steps are generally, different. This fact, which was not taken into account in the previous book, is indeed important in practice. For example, the subgradient projection algorithm consists of two steps. The first step is a calculation of a subgradient of the objective function while in the second one we calculate a projection on the feasible set. In each of these two steps there is a computational error and these two computational errors are different in general. It may happen that the feasible set is simple and the objective function is complicated. As a result, the computational error, made when one calculates the projection, is essentially smaller than the computational error of the calculation of the subgradient. Clearly, an opposite case is possible too. Another feature of this book is a study of a number of important algorithms which appeared recently in the literature and which are not discussed in the previous book. This monograph contains 12 chapters. Chapter 1 is an introduction. In Chapter 2 we study the subgradient projection algorithm for minimization of convex and nonsmooth functions. We generalize the results of [NOCE] and establish results which has no prototype in [NOCE]. In Chapter 3 we analyze the mirror descent algorithm for minimization of convex and nonsmooth functions, under the presence of computational errors. For this algorithm each iteration consists of two steps. The first step is a calculation of a subgradient of the objective function while in the second one we solve an auxiliary minimization problem on the set of feasible points. In each of these two steps there is a computational error. We generalize the results of [NOCE] and establish results which has no prototype in [NOCE]. In Chapter 4 we analyze the projected gradient algorithm with a smooth objective function under the presence of computational errors. In Chapter 5 we consider an algorithm, which is an extension of the projection gradient algorithm used for solving linear inverse problems arising in signal/image processing. In Chapter 6 we study continuous subgradient method and continuous subgradient projection algorithm for minimization of convex nonsmooth functions and for computing the saddle points of convex-concave functions, under the presence of computational errors. All the results of this chapter has no prototype in [NOCE]. In Chapters 7-12 we analyze several algorithms under the presence of computational errors which were not considered in [NOCE]. Again, each step of an iteration has a computational errors and we take into account that these errors are, in general, different. An optimization problems with a composite objective function is studied in Chapter 7. A zero-sum game with two-players is considered in Chapter 8. A predicted decrease approximation-based method is used in Chapter 9 for constrained convex optimization. Chapter 10 is devoted to minimization of quasiconvex functions. Minimization of sharp weakly convex functions is discussed in Chapter 11. Chapter 12 is devoted to a generalized projected subgradient method for minimization of a convex function over a set which is not necessarily convex. The book is of interest for researchers and engineers working in optimization. It also can be useful in preparation courses for graduate students. The main feature of the book which appeals specifically to this audience is the study of the influence of computational errors for several important optimization algorithms. The book is of interest for experts in applications of optimization to engineering and economics.

The theory presented in this work merges many concepts from mathematical optimization and real algebraic geometry. When unknown or uncertain data in an optimization problem is replaced with parameters, one obtains a multi-parametric optimization problem whose optimal solution comes in the form of a function of the parameters.The theory and methodology presented in this work allows one to solve both Linear Programs and convex Quadratic Programs containing parameters in any location within the problem data as well as multi-objective optimization problems with any number of convex quadratic or linear objectives and linear constraints. Applications of these classes of problems are extremely widespread, ranging from business and economics to chemical and environmental engineering. Prior to this work, no solution procedure existed for these general classes of problems except for the recently proposed algorithms

This book introduces readers to the use of R codes for optimization problems. First, it provides the necessary background to understand data envelopment analysis (DEA), with a special emphasis on fuzzy DEA. It then describes DEA models, including fuzzy DEA models, and shows how to use them to solve optimization problems with R. Further, it discusses the main advantages of R in optimization problems, and provides R codes based on real-world data sets throughout. Offering a comprehensive review of DEA and fuzzy DEA models and the corresponding R codes, this practice-oriented reference guide is intended for masters and Ph.D. students in various disciplines, as well as practitioners and researchers.

This book treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The author describes and analyses some of the best-known algorithms for colouring arbitrary graphs, focusing on whether these heuristics can provide optimal solutions in some cases; how they perform on graphs where the chromatic number is unknown; and whether they can produce better solutions than other algorithms for certain types of graphs, and why. The introductory chapters explain graph colouring, and bounds and constructive algorithms. The author then shows how advanced, modern techniques can be applied to classic real-world operational research problems such as seating plans, sports scheduling, and university timetabling. He includes many examples, suggestions for further reading, and historical notes, and the book is supplemented by a website with an online suite of downloadable code. The book will be of value to researchers, graduate students, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. The reader should have elementary knowledge of sets, matrices, and enumerative combinatorics.

This book studies complex systems with elements represented by random variables. Its main goal is to study and compare uncertainty of algorithms of network structure identification with applications to market network analysis. For this, a mathematical model of random variable network is introduced, uncertainty of identification procedure is defined through a risk function, random variables networks with different measures of similarity (dependence) are discussed, and general statistical properties of identification algorithms are studied. The volume also introduces a new class of identification algorithms based on a new measure of similarity and prove its robustness in a large class of distributions, and presents applications to social networks, power transmission grids, telecommunication networks, stock market networks, and brain networks through a theoretical analysis that identifies network structures. Both researchers and graduate students in computer science, mathematics, and optimization will find the applications and techniques presented useful.

This Springer brief discusses the use of control engineering methods to plan a cancer therapy which tends to reduce tumour size in patients, striking a balance that minimizes the toxic effects of the treatment. The authors address the design and computation of impulsive control therapies, a methodology previously underexplored in the application of control methods to medical modelling. This allows simulation of such discrete events as taking a pill rather than relying on the supply of therapy being continuous and steady. The book begins with an introduction to the topic, before moving onto pharmacokinetic, pharmacodynamical and tumour-growth models and explaining how they describe the relationship between a certain therapy plan and the evolution of cancer. This is placed firmly in the context of work introducing impulsive differential equations. The final chapter summarizes the research presented and suggests future areas of research to encourage readers in taking the subject forward. This book is of interest to biomedical engineers, researchers and students, particularly those with a background in systems and control engineering.

This volume comprises selected, revised papers from the Joint CIM-WIAS Workshop, TAAO 2017, held in Lisbon, Portugal, in December 2017. The workshop brought together experts from research groups at the Weierstrass Institute in Berlin and mathematics centres in Portugal to present and discuss current scientific topics and to promote existing and future collaborations. The papers include the following topics: PDEs with applications to material sciences, thermodynamics and laser dynamics, scientific computing, nonlinear optimization and stochastic analysis.

This book explores mathematics in a wide variety of applications, ranging from problems in electronics, energy and the environment, to mechanics and mechatronics. The book gathers 81 contributions submitted to the 20th European Conference on Mathematics for Industry, ECMI 2018, which was held in Budapest, Hungary in June 2018. The application areas include: Applied Physics, Biology and Medicine, Cybersecurity, Data Science, Economics, Finance and Insurance, Energy, Production Systems, Social Challenges, and Vehicles and Transportation. In turn, the mathematical technologies discussed include: Combinatorial Optimization, Cooperative Games, Delay Differential Equations, Finite Elements, Hamilton-Jacobi Equations, Impulsive Control, Information Theory and Statistics, Inverse Problems, Machine Learning, Point Processes, Reaction-Diffusion Equations, Risk Processes, Scheduling Theory, Semidefinite Programming, Stochastic Approximation, Spatial Processes, System Identification, and Wavelets. The goal of the European Consortium for Mathematics in Industry (ECMI) conference series is to promote interaction between academia and industry, leading to innovations in both fields. These events have attracted leading experts from business, science and academia, and have promoted the application of novel mathematical technologies to industry. They have also encouraged industrial sectors to share challenging problems where mathematicians can provide fresh insights and perspectives. Lastly, the ECMI conferences are one of the main forums in which significant advances in industrial mathematics are presented, bringing together prominent figures from business, science and academia to promote the use of innovative mathematics in industry.

This focused monograph presents a study of subgradient algorithms for constrained minimization problems in a Hilbert space. The book is of interest for experts in applications of optimization to engineering and economics. The goal is to obtain a good approximate solution of the problem in the presence of computational errors. The discussion takes into consideration the fact that for every algorithm its iteration consists of several steps and that computational errors for different steps are different, in general. The book is especially useful for the reader because it contains solutions to a number of difficult and interesting problems in the numerical optimization. The subgradient projection algorithm is one of the most important tools in optimization theory and its applications. An optimization problem is described by an objective function and a set of feasible points. For this algorithm each iteration consists of two steps. The first step requires a calculation of a subgradient of the objective function; the second requires a calculation of a projection on the feasible set. The computational errors in each of these two steps are different. This book shows that the algorithm discussed, generates a good approximate solution, if all the computational errors are bounded from above by a small positive constant. Moreover, if computational errors for the two steps of the algorithm are known, one discovers an approximate solution and how many iterations one needs for this. In addition to their mathematical interest, the generalizations considered in this book have a significant practical meaning.

This book provides a comprehensive introduction to nonlinear programming, featuring a broad range of applications and solution methods in the field of continuous optimization. It begins with a summary of classical results on unconstrained optimization, followed by a wealth of applications from a diverse mix of fields, e.g. location analysis, traffic planning, and water quality management, to name but a few. In turn, the book presents a formal description of optimality conditions, followed by an in-depth discussion of the main solution techniques. Each method is formally described, and then fully solved using a numerical example.

This book contains mostly the author's up-to-date research results in the area. Option pricing has attracted much attention in the past decade from applied mathematicians, statisticians, practitioners and educators. Many partial differential equation-based theoretical models have been developed for valuing various options. These models do not have any practical use unless their solutions can be found. However, most of these models are far too complex to solve analytically and numerical approximations have to be sought in practice. The contents of the book consist of three parts: (i) basic theory of stochastic control and formulation of various option pricing models, (ii) design of finite volume, finite difference and penalty-based algorithms for solving the models and (iii) stability and convergence analysis of the algorithms. It also contains extensive numerical experiments demonstrating how these algorithms perform for practical problems. The theoretical and numerical results demonstrate these algorithms provide efficient, accurate and easy-to-implement numerical tools for financial engineers to price options. This book is appealing to researchers in financial engineering, optimal control and operations research. Financial engineers and practitioners will also find the book helpful in practice.

This book features a selection of contributions that were presented at the Modeling and Optimization: Theory and Applications Conference (MOPTA) held at Lehigh University in B ethlehem, Pennsylvania, USA between August 16-18, 2017. The conference brought together a diverse group of researchers and practitioners working on both theoretical and practical aspects of continuous and discrete optimization. Topics covered include algorithms for solving convex, network, mixed-integer, nonlinear, and global optimization problems, and address the application of deterministic andstochastic optimization techniques in energy, finance, logistics, analytics, health, and other important fields. The selected contributions in this book illustrate the broad diversity of ideas discussed at the meeting.