Global Optimization


Book Description

This volume contains a thorough overview of the rapidly growing field of global optimization, with chapters on key topics such as complexity, heuristic methods, derivation of lower bounds for minimization problems, and branch-and-bound methods and convergence. The final chapter offers both benchmark test problems and applications of global optimization, such as finding the conformation of a molecule or planning an optimal trajectory for interplanetary space travel. An appendix provides fundamental information on convex and concave functions. Intended for Ph.D. students, researchers, and practitioners looking for advanced solution methods to difficult optimization problems. It can be used as a supplementary text in an advanced graduate-level seminar.




Perspectives in Flow Control and Optimization


Book Description

Introduces several approaches for solving flow control and optimization problems through the use of modern methods.




Control and Optimization with Differential-Algebraic Constraints


Book Description

A cutting-edge guide to modelling complex systems with differential-algebraic equations, suitable for applied mathematicians, engineers and computational scientists.




Advanced and Optimization Based Sliding Mode Control: Theory and Applications


Book Description

A compendium of the authorsÂ’ recently published results, this book discusses sliding mode control of uncertain nonlinear systems, with a particular emphasis on advanced and optimization based algorithms. The authors survey classical sliding mode control theory and introduce four new methods of advanced sliding mode control. They analyze classical theory and advanced algorithms, with numerical results complementing the theoretical treatment. Case studies examine applications of the algorithms to complex robotics and power grid problems. Advanced and Optimization Based Sliding Mode Control: Theory and Applications is the first book to systematize the theory of optimization based higher order sliding mode control and illustrate advanced algorithms and their applications to real problems. It presents systematic treatment of event-triggered and model based event-triggered sliding mode control schemes, including schemes in combination with model predictive control, and presents adaptive algorithms as well as algorithms capable of dealing with state and input constraints. Additionally, the book includes simulations and experimental results obtained by applying the presented control strategies to real complex systems. This book is suitable for students and researchers interested in control theory. It will also be attractive to practitioners interested in implementing the illustrated strategies. It is accessible to anyone with a basic knowledge of control engineering, process physics, and applied mathematics.




First-Order Methods in Optimization


Book Description

The primary goal of this book is to provide a self-contained, comprehensive study of the main ?rst-order methods that are frequently used in solving large-scale problems. First-order methods exploit information on values and gradients/subgradients (but not Hessians) of the functions composing the model under consideration. With the increase in the number of applications that can be modeled as large or even huge-scale optimization problems, there has been a revived interest in using simple methods that require low iteration cost as well as low memory storage. The author has gathered, reorganized, and synthesized (in a unified manner) many results that are currently scattered throughout the literature, many of which cannot be typically found in optimization books. First-Order Methods in Optimization offers comprehensive study of first-order methods with the theoretical foundations; provides plentiful examples and illustrations; emphasizes rates of convergence and complexity analysis of the main first-order methods used to solve large-scale problems; and covers both variables and functional decomposition methods.




Real-time PDE-constrained Optimization


Book Description

Many engineering and scientific problems in design, control, and parameter estimation can be formulated as optimization problems that are governed by partial differential equations (PDEs). The complexities of the PDEs--and the requirement for rapid solution--pose significant difficulties. A particularly challenging class of PDE-constrained optimization problems is characterized by the need for real-time solution, i.e., in time scales that are sufficiently rapid to support simulation-based decision making. Real-Time PDE-Constrained Optimization, the first book devoted to real-time optimization for systems governed by PDEs, focuses on new formulations, methods, and algorithms needed to facilitate real-time, PDE-constrained optimization. In addition to presenting state-of-the-art algorithms and formulations, the text illustrates these algorithms with a diverse set of applications that includes problems in the areas of aerodynamics, biology, fluid dynamics, medicine, chemical processes, homeland security, and structural dynamics. Audience: readers who have expertise in simulation and are interested in incorporating optimization into their simulations, who have expertise in numerical optimization and are interested in adapting optimization methods to the class of infinite-dimensional simulation problems, or who have worked in "offline" optimization contexts and are interested in moving to "online" optimization.







Trust Region Methods


Book Description

Mathematics of Computing -- General.




Arc Routing


Book Description

This book provides a thorough and up-to-date discussion of arc routing by world-renowned researchers. Organized by problem type, the book offers a rigorous treatment of complexity issues, models, algorithms, and applications. Arc Routing: Problems, Methods, and Applications opens with a historical perspective of the field and is followed by three sections that cover complexity and the Chinese Postman and the Rural Postman problems; the Capacitated Arc Routing Problem and routing problems with min-max and profit maximization objectives; and important applications, including meter reading, snow removal, and waste collection.




Parameterized Algorithms


Book Description

This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way. The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds. All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.