This book addresses the mathematical and the practical aspects of motion implied by advanced control theory. The richness and power of the theory are demonstrated by separate analyses of single-model and multi-modal repertoires, consisting of verities of estimation and control facets. Starting with purely mathematical concepts, specifically, abstract probability and information theories, model control theory is gradually revealed as a rather amazing domain. The mathematical equations, taking essentially simple forms, are exposed as powerful generators of motion. Moreover, seemingly obvious applications of the theory, such as high-performance aircraft control make room for unexpected virtual reality feedback in control of motion for the neurologically impaired.Following the presentation of some historical milestones and mathematical preliminaries, the book is divided into four parts. The first deals with minimal-order models of state estimation and control. The second addresses multi-modal estimation and control, which facilitates the operation of high-performance aircraft in large flight envelopes. The third presents the transition from naturally nonlinear control of movement in obstacle avoidance and object targeting to virtually linear control of movement in the neurologically impaired. The fourth and final part of the book addresses the application of virtual sensory feedback in walking with specific neurological impairment. While the clinical studies reported were all based on a single-model paradigm, a later reflection reveals that, given the variety of neurological symptoms associated with the relevant disorders, a multi-modal approach, as that addressed in the control of high-performance aircraft in a large flight envelope, would be similarly applicable in the treatment of neurological disorders.

Optimization problems were and still are the focus of mathematics from antiquity to the present. Since the beginning of our civilization, the human race has had to confront numerous technological challenges, such as finding the optimal solution of various problems including control technologies, power sources construction, applications in economy, mechanical engineering and energy distribution amongst others. These examples encompass both ancient as well as modern technologies like the first electrical energy distribution network in USA etc. Some of the key principles formulated in the middle ages were done by Johannes Kepler (Problem of the wine barrels), Johan Bernoulli (brachystochrone problem), Leonhard Euler (Calculus of Variations), Lagrange (Principle multipliers), that were formulated primarily in the ancient world and are of a geometric nature. In the beginning of the modern era, works of L.V. Kantorovich and G.B. Dantzig (so-called linear programming) can be considered amongst others. This book discusses a wide spectrum of optimization methods from classical to modern, alike heuristics. Novel as well as classical techniques is also discussed in this book, including its mutual intersection. Together with many interesting chapters, a reader will also encounter various methods used for proposed optimization approaches, such as game theory and evolutionary algorithms or modelling of evolutionary algorithm dynamics like complex networks.

The book discusses three classes of problems: the generalized Nash equilibrium problems, the bilevel problems and the mathematical programming with equilibrium constraints (MPEC). These problems interact through their mathematical analysis as well as their applications. The primary aim of the book is to present the modern tool of variational analysis and optimization, which are used to analyze these three classes of problems. All contributing authors are respected academicians, scientists and researchers from around the globe. These contributions are based on the lectures delivered by experts at CIMPA School, held at the University of Delhi, India, from 25 November-6 December 2013, and peer-reviewed by international experts. The book contains five chapters. Chapter 1 deals with nonsmooth, nonconvex bilevel optimization problems whose feasible set is described by using the graph of the solution set mapping of a parametric optimization problem. Chapter 2 describes a constraint qualification to MPECs considered as an application of calmness concept of multifunctions and is used to derive M-stationarity conditions for MPEC. Chapter 3 discusses the first- and second-order optimality conditions derived for a special case of a bilevel optimization problem in which the constraint set of the lower level problem is described as a general compact convex set. Chapter 4 concentrates the results of the modelization and analysis of deregulated electricity markets with a focus on auctions and mechanism design. Chapter 5 focuses on optimization approaches called reflection methods for protein conformation determination within the framework of matrix completion. The last chapter (Chap. 6) deals with the single-valuedness of quasimonotone maps by using the concept of single-directionality with a special focus on the case of the normal operator of lower semi-continuous quasiconvex functions.

Data-driven discovery is revolutionizing the modeling, prediction, and control of complex systems. This textbook brings together machine learning, engineering mathematics, and mathematical physics to integrate modeling and control of dynamical systems with modern methods in data science. It highlights many of the recent advances in scientific computing that enable data-driven methods to be applied to a diverse range of complex systems, such as turbulence, the brain, climate, epidemiology, finance, robotics, and autonomy. Aimed at advanced undergraduate and beginning graduate students in the engineering and physical sciences, the text presents a range of topics and methods from introductory to state of the art.

This book presents an epistemic framework for dealing with information-knowledge and certainty-uncertainty problems within the space of quality-quantity dualities. It bridges between theoretical concepts of entropy and entropy measurements, proposing the concept and measurement of fuzzy-stochastic entropy that is applicable to all areas of knowing under human cognitive limitations over the epistemological space. The book builds on two previous monographs by the same author concerning theories of info-statics and info-dynamics, to deal with identification and transformation problems respectively. The theoretical framework is developed by using the toolboxes such as those of the principle of opposites, systems of actual-potential polarities and negative-positive dualities, under different cost-benefit time-structures. The category theory and the fuzzy paradigm of thought, under methodological constructionism-reductionism duality, are used in the fuzzy-stochastic and cost-benefit spaces to point to directions of global application in knowing, knowledge and decision-choice actions. Thus, the book is concerned with a general theory of entropy, showing how the fuzzy paradigm of thought is developed to deal with the problems of qualitative-quantitative uncertainties over the fuzzy-stochastic space, which will be applicable to conditions of soft-hard data, fact, evidence and knowledge over the spaces of problem-solution dualities, decision-choice actions in sciences, non-sciences, engineering and planning sciences to abstract acceptable information-knowledge elements.

This book is designed to serve as a textbook for courses offered to undergraduate and graduate students enrolled in Mathematics. The first edition of this book was published in 2015. As there is a demand for the next edition, it is quite natural to take note of the several suggestions received from the users of the earlier edition over the past six years. This is the prime motivation for bringing out a revised second edition with a thorough revision of all the chapters. The book provides a clear understanding of the basic concepts of differential and integral calculus starting with the concepts of sequences and series of numbers, and also introduces slightly advanced topics such as sequences and series of functions, power series, and Fourier series which would be of use for other courses in mathematics for science and engineering programs. The salient features of the book are - precise definitions of basic concepts; several examples for understanding the concepts and for illustrating the results; includes proofs of theorems; exercises within the text; a large number of problems at the end of each chapter as home-assignments. The student-friendly approach of the exposition of the book would be of great use not only for students but also for the instructors. The detailed coverage and pedagogical tools make this an ideal textbook for students and researchers enrolled in a mathematics course.

This text covers the basic theory and computation for mathematical modeling in linear programming. It provides a strong background on how to set up mathematical proofs and high-level computation methods, and includes substantial background material and direction. Paris presents an intuitive and novel discussion of what it means to solve a system of equations that is a crucial stepping stone for solving any linear program. The discussion of the simplex method for solving linear programs gives an economic interpretation to every step of the simplex algorithm. The text combines in a unique and novel way the microeconomics of production with the structure of linear programming to give students and scholars of economics a clear notion of what it means, formulating a model of economic equilibrium and the computation of opportunity cost in the presence of many outputs and inputs.

This highly informative and carefully presented textbook introduces the general principles involved in system design and optimization as applicable to thermal systems, followed by the methods to accomplish them. It introduces contemporary techniques like Genetic Algorithms, Simulated Annealing, and Bayesian Inference in the context of optimization of thermal systems. There is a separate chapter devoted to inverse problems in thermal systems. It also contains sections on Integer Programming and Multi-Objective optimization. The linear programming chapter is fortified by a detailed presentation of the Simplex method. A major highlight of the textbook is the inclusion of workable MATLAB codes for examples of key algorithms discussed in the book. Examples in each chapter clarify the concepts and methods presented and end-of-chapter problems supplement the material presented and enhance the learning process.

The sequential quadratic hamiltonian (SQH) method is a novel numerical optimization procedure for solving optimal control problems governed by differential models. It is based on the characterisation of optimal controls in the framework of the Pontryagin maximum principle (PMP). The SQH method is a powerful computational methodology that is capable of development in many directions. The Sequential Quadratic Hamiltonian Method: Solving Optimal Control Problems discusses its analysis and use in solving nonsmooth ODE control problems, relaxed ODE control problems, stochastic control problems, mixed-integer control problems, PDE control problems, inverse PDE problems, differential Nash game problems, and problems related to residual neural networks. This book may serve as a textbook for undergraduate and graduate students, and as an introduction for researchers in sciences and engineering who intend to further develop the SQH method or wish to use it as a numerical tool for solving challenging optimal control problems and for investigating the Pontryagin maximum principle on new optimisation problems. Feature Provides insight into mathematical and computational issues concerning optimal control problems, while discussing many differential models of interest in different disciplines. Suitable for undergraduate and graduate students and as an introduction for researchers in sciences and engineering. Accompanied by codes which allow the reader to apply the SQH method to solve many different optimal control and optimisation problems

The rich, multi-faceted and multi-disciplinary field of matching-based market design is an active and important one due to its highly successful applications with economic and sociological impact. Its home is economics, but with intimate connections to algorithm design and operations research. With chapters contributed by over fifty top researchers from all three disciplines, this volume is unique in its breadth and depth, while still being a cohesive and unified picture of the field, suitable for the uninitiated as well as the expert. It explains the dominant ideas from computer science and economics underlying the most important results on market design and introduces the main algorithmic questions and combinatorial structures. Methodologies and applications from both the pre-Internet and post-Internet eras are covered in detail. Key chapters discuss the basic notions of efficiency, fairness and incentives, and the way market design seeks solutions guided by normative criteria borrowed from social choice theory.

This book presents a panorama about the recent progress of industrial mathematics from the point of view of both industrials and researchers. The chapters correspond to a selection of the contributions presented in the "Industry Day" and in the Minisymposium "EU - MATHS - IN: Success Stories of Applications of Mathematics to Industry" organized in the framework of the International Conference ICIAM 2019 held in Valencia (Spain) on July 15-19, 2019. In the Industry Day, included for the first time in this series of Conferences, representatives of companies from different countries and several sectors presented their view about the benefits regarding the usage of mathematical tools and/or collaboration with mathematicians. The contributions of this special session were addressed to industry people. Minisymposium contributions detailed some collaborations between mathematicians and industrials that led to real benefits in several European companies. All the speakers were affiliated in some of the European National Networks that constitute the European Service Network of Mathematics for Industry and Innovation (EU-MATHS-IN).

This book proposes novel methods for solving different types of non-cooperative games with interval/fuzzy/intuitionistic fuzzy payoffs. It starts by discussing several existing methods and shows that some mathematically incorrect assumptions have been considered in all these methods. It then proposes solutions to adapt those methods and validate the new proposed methods, such as Gaurika method Ambika-I-IV, Mehar method and others, by using them for solving existing numerical problems. The book offers a comprehensive guide on non-cooperative games with fuzzy payoffs to both students and researchers. It provides them with the all the necessary tools to understand the methods and the theory behind them.

Mechanism design is an analytical framework for thinking clearly and carefully about what exactly a given institution can achieve when the information necessary to make decisions is dispersed and privately held. This analysis provides an account of the underlying mathematics of mechanism design based on linear programming. Three advantages characterize the approach. The first is simplicity: arguments based on linear programming are both elementary and transparent. The second is unity: the machinery of linear programming provides a way to unify results from disparate areas of mechanism design. The third is reach: the technique offers the ability to solve problems that appear to be beyond solutions offered by traditional methods. No claim is made that the approach advocated should supplant traditional mathematical machinery. Rather, the approach represents an addition to the tools of the economic theorist who proposes to understand economic phenomena through the lens of mechanism design.

With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence, and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.

This book is a collection of selected papers presented at the consecutively held international conferences on "Game Theory and Networks", organized by the Department of Mathematics, Dibrugarh University, India, in collaboration with the Economics Department of Queen's University, Belfast, UK, during September 6-9, 2019 and September, 13-15 2018. The book includes chapters on network measures and network formation, application of network theory to contagion, biological data and finance and macroeconomics as expository articles. The book also contains chapters on fair allocation in the context of queuing, rationing and cooperative games with transferable utilities for engaged researchers. A few survey chapters on non-cooperative game theory, evolutionary game theory, mechanism design and social choice theory are also incorporated to cater to the needs of the beginners in the field. This book discusses the use of game theoretic tools and network models across disciplines: mathematics, statistics, economics, computer science, political science, sociology and psychology. It aims at providing a suitable learning experience to beginners on the basics of cooperative games, networks and mechanism design, as well as recent developments to research scholars having the basic knowledge of these topics.

This book contains extended, in-depth presentations of the plenary talks from the 16th French-German-Polish Conference on Optimization, held in Krakow, Poland in 2013. Each chapter in this book exhibits a comprehensive look at new theoretical and/or application-oriented results in mathematical modeling, optimization, and optimal control. Students and researchers involved in image processing, partial differential inclusions, shape optimization, or optimal control theory and its applications to medical and rehabilitation technology, will find this book valuable. The first chapter by Martin Burger provides an overview of recent developments related to Bregman distances, which is an important tool in inverse problems and image processing. The chapter by Piotr Kalita studies the operator version of a first order in time partial differential inclusion and its time discretization. In the chapter by Gunter Leugering, Jan Sokolowski and Antoni Zochowski, nonsmooth shape optimization problems for variational inequalities are considered. The next chapter, by Katja Mombaur is devoted to applications of optimal control and inverse optimal control in the field of medical and rehabilitation technology, in particular in human movement analysis, therapy and improvement by means of medical devices. The final chapter, by Nikolai Osmolovskii and Helmut Maurer provides a survey on no-gap second order optimality conditions in the calculus of variations and optimal control, and a discussion of their further development.

This Palgrave Pivot presents tournament design mainly within the axioms of incentive compatibility and fairness. It illustrates the advantages of an axiomatic approach through various examples, including several FIFA and UEFA tournaments, and uses theoretical tools and simulation methodology in its analysis. Chapter 1 discusses scoring systems of championships with multiple competitions, ranking in Swiss-system tournaments, and tie-breaking rules in round-robin leagues. It is followed by a thorough critical analysis of the current and previous FIFA World Rankings. The broad focus is substantially narrowed in Chapter 2, which turns to the topic of incentive (in)compatibility in multiple qualifiers. It is revealed that UEFA has faced at least three times recently this problem in the qualification to the UEFA Europa League, qualification to the UEFA Champions League, and the draw of the UEFA Champions League groups. Analogously, Chapter 3 discusses incentive (in)compatibility when there is only one group-based tournament but the complex progression rules to the subsequent stage can be designed poorly. Our examples include the qualifying tournaments of recent FIFA World Cups and UEFA European Championships. Chapter 4 moves to the problem of penalty shootout rules in soccer, where the fairness and complexity of some alternative mechanisms from the literature are evaluated. Fairness remains the central issue in Chapter 5, which presents the challenges of designing a tournament with 24 teams if the number of teams per group cannot exceed four. As expected, there is no perfect solution, and both FIFA and UEFA have introduced a reform in this format recently. Chapter 6 deals with the qualification for the 2020 UEFA European Football Championship. Its tournament design is perhaps the most complicated one that has ever been implemented in the real-world and suffers from serious shortcomings.

This carefully curated volume presents an in-depth, state-of-the-art discussion on many applications of Synthetic Aperture Radar (SAR). Integrating interdisciplinary sciences, the book features novel ideas, quantitative methods, and research results, promising to advance computational practices and technologies within the academic and industrial communities. SAR applications employ diverse and often complex computational methods rooted in machine learning, estimation, statistical learning, inversion models, and empirical models. Current and emerging applications of SAR data for earth observation, object detection and recognition, change detection, navigation, and interference mitigation are highlighted. Cutting edge methods, with particular emphasis on machine learning, are included. Contemporary deep learning models in object detection and recognition in SAR imagery with corresponding feature extraction and training schemes are considered. State-of-the-art neural network architectures in SAR-aided navigation are compared and discussed further. Advanced empirical and machine learning models in retrieving land and ocean information - wind, wave, soil conditions, among others, are also included.

This book systematically discusses nonlinear interval optimization design theory and methods. Firstly, adopting a mathematical programming theory perspective, it develops an innovative mathematical transformation model to deal with general nonlinear interval uncertain optimization problems, which is able to equivalently convert complex interval uncertain optimization problems to simple deterministic optimization problems. This model is then used as the basis for various interval uncertain optimization algorithms for engineering applications, which address the low efficiency caused by double-layer nested optimization. Further, the book extends the nonlinear interval optimization theory to design problems associated with multiple optimization objectives, multiple disciplines, and parameter dependence, and establishes the corresponding interval optimization models and solution algorithms. Lastly, it uses the proposed interval uncertain optimization models and methods to deal with practical problems in mechanical engineering and related fields, demonstrating the effectiveness of the models and methods.

Two approaches are known for solving large-scale unconstrained optimization problems-the limited-memory quasi-Newton method (truncated Newton method) and the conjugate gradient method. This is the first book to detail conjugate gradient methods, showing their properties and convergence characteristics as well as their performance in solving large-scale unconstrained optimization problems and applications. Comparisons to the limited-memory and truncated Newton methods are also discussed. Topics studied in detail include: linear conjugate gradient methods, standard conjugate gradient methods, acceleration of conjugate gradient methods, hybrid, modifications of the standard scheme, memoryless BFGS preconditioned, and three-term. Other conjugate gradient methods with clustering the eigenvalues or with the minimization of the condition number of the iteration matrix, are also treated. For each method, the convergence analysis, the computational performances and the comparisons versus other conjugate gradient methods are given. The theory behind the conjugate gradient algorithms presented as a methodology is developed with a clear, rigorous, and friendly exposition; the reader will gain an understanding of their properties and their convergence and will learn to develop and prove the convergence of his/her own methods. Numerous numerical studies are supplied with comparisons and comments on the behavior of conjugate gradient algorithms for solving a collection of 800 unconstrained optimization problems of different structures and complexities with the number of variables in the range [1000,10000]. The book is addressed to all those interested in developing and using new advanced techniques for solving unconstrained optimization complex problems. Mathematical programming researchers, theoreticians and practitioners in operations research, practitioners in engineering and industry researchers, as well as graduate students in mathematics, Ph.D. and master students in mathematical programming, will find plenty of information and practical applications for solving large-scale unconstrained optimization problems and applications by conjugate gradient methods.

Optimal feedback control arises in different areas such as aerospace engineering, chemical processing, resource economics, etc. In this context, the application of dynamic programming techniques leads to the solution of fully nonlinear Hamilton-Jacobi-Bellman equations. This book presents the state of the art in the numerical approximation of Hamilton-Jacobi-Bellman equations, including post-processing of Galerkin methods, high-order methods, boundary treatment in semi-Lagrangian schemes, reduced basis methods, comparison principles for viscosity solutions, max-plus methods, and the numerical approximation of Monge-Ampere equations. This book also features applications in the simulation of adaptive controllers and the control of nonlinear delay differential equations. Contents From a monotone probabilistic scheme to a probabilistic max-plus algorithm for solving Hamilton-Jacobi-Bellman equations Improving policies for Hamilton-Jacobi-Bellman equations by postprocessing Viability approach to simulation of an adaptive controller Galerkin approximations for the optimal control of nonlinear delay differential equations Efficient higher order time discretization schemes for Hamilton-Jacobi-Bellman equations based on diagonally implicit symplectic Runge-Kutta methods Numerical solution of the simple Monge-Ampere equation with nonconvex Dirichlet data on nonconvex domains On the notion of boundary conditions in comparison principles for viscosity solutions Boundary mesh refinement for semi-Lagrangian schemes A reduced basis method for the Hamilton-Jacobi-Bellman equation within the European Union Emission Trading Scheme

The series is designed to bring together those mathematicians who are seriously interested in getting new challenging stimuli from economic theories with those economists who are seeking effective mathematical tools for their research. A lot of economic problems can be formulated as constrained optimizations and equilibration of their solutions. Various mathematical theories have been supplying economists with indispensable machineries for these problems arising in economic theory. Conversely, mathematicians have been stimulated by various mathematical difficulties raised by economic theories.

This work presents recent mathematical methods in the area of optimal control with a particular emphasis on the computational aspects and applications. Optimal control theory concerns the determination of control strategies for complex dynamical systems, in order to optimize some measure of their performance. Started in the 60's under the pressure of the "space race" between the US and the former USSR, the field now has a far wider scope, and embraces a variety of areas ranging from process control to traffic flow optimization, renewable resources exploitation and management of financial markets. These emerging applications require more and more efficient numerical methods for their solution, a very difficult task due the huge number of variables. The chapters of this volume give an up-to-date presentation of several recent methods in this area including fast dynamic programming algorithms, model predictive control and max-plus techniques. This book is addressed to researchers, graduate students and applied scientists working in the area of control problems, differential games and their applications.

Optimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, the Conference on Discrete Geometry and Optimization, and the Workshop on Optimization, held in September 2011 at the Fields Institute, Toronto, was to further stimulate the interaction between geometers and optimizers. This volume reflects the interplay between these areas.

The inspiring Fejes Toth Lecture Series, delivered by Thomas Hales of the University of Pittsburgh, exemplified this approach. While these fields have recently witnessed a lot of activity and successes, many questions remain open. For example, Fields medalist Stephen Smale stated that the question of the existence of a strongly polynomial time algorithm for linear optimization is one of the most important unsolved problems at the beginning of the 21st century. The broad range of topics covered in this volume demonstrates the many recent and fruitful connections between different approaches, and features novel results and state-of-the-art surveys as well as open problems. "