Focused on efficient simulation-driven multi-fidelity optimization techniques, this monograph on simulation-driven optimization covers simulations utilizing physics-based low-fidelity models, often based on coarse-discretization simulations or other types of simplified physics representations, such as analytical models. The methods presented in the book exploit as much as possible any knowledge about the system or device of interest embedded in the low-fidelity model with the purpose of reducing the computational overhead of the design process. Most of the techniques described in the book are of response correction type and can be split into parametric (usually based on analytical formulas) and non-parametric, i.e., not based on analytical formulas. The latter, while more complex in implementation, tend to be more efficient. The book presents a general formulation of response correction techniques as well as a number of specific methods, including those based on correcting the low-fidelity model response (output space mapping, manifold mapping, adaptive response correction and shape-preserving response prediction), as well as on suitable modification of design specifications. Detailed formulations, application examples and the discussion of advantages and disadvantages of these techniques are also included. The book demonstrates the use of the discussed techniques for solving real-world engineering design problems, including applications in microwave engineering, antenna design, and aero/hydrodynamics.

Lagrange and penalty function methods provide a powerful approach, both as a theoretical tool and a computational vehicle, for the study of constrained optimization problems. However, for a nonconvex constrained optimization problem, the classical Lagrange primal-dual method may fail to find a mini mum as a zero duality gap is not always guaranteed. A large penalty parameter is, in general, required for classical quadratic penalty functions in order that minima of penalty problems are a good approximation to those of the original constrained optimization problems. It is well-known that penaity functions with too large parameters cause an obstacle for numerical implementation. Thus the question arises how to generalize classical Lagrange and penalty functions, in order to obtain an appropriate scheme for reducing constrained optimiza tion problems to unconstrained ones that will be suitable for sufficiently broad classes of optimization problems from both the theoretical and computational viewpoints. Some approaches for such a scheme are studied in this book. One of them is as follows: an unconstrained problem is constructed, where the objective function is a convolution of the objective and constraint functions of the original problem. While a linear convolution leads to a classical Lagrange function, different kinds of nonlinear convolutions lead to interesting generalizations. We shall call functions that appear as a convolution of the objective function and the constraint functions, Lagrange-type functions."

This textbook examines a broad range of problems in science and engineering, describing key numerical methods applied to real life. The case studies presented are in such areas as data fitting, vehicle route planning and optimal control, scheduling and resource allocation, sensitivity calculations and worst-case analysis.

Chapters are self-contained with exercises provided at the end of most sections. Nonlinear Optimization with Engineering Applications is ideal for self-study and classroom use in engineering courses at the senior undergraduate or graduate level. The book will also appeal to postdocs and advanced researchers interested in the development and use of optimization algorithms.

The results presented in this book are a product of research conducted by the author independently and in collaboration with other researchers in the field. In this light, this work encompasses the most recent collection of various concepts of regularity and nonsmooth analysis into one monograph. The first part of the book attempts to present an accessible and thorough introduction to nonsmooth analysis theory. Main concepts and some useful results are stated and illustrated through examples and exercises. The second part gathers the most prominent and recent results of various regularity concepts of sets, functions, and set-valued mappings in nonsmooth analysis. The third and final section contains six different application, with comments in relation to the existing literature.

The objective of this book is to advance the current knowledge of sensor research particularly highlighting recent advances, current work, and future needs. The goal is to share current technologies and steer future efforts in directions that will benefit the majority of researchers and practitioners working in this broad field of study.

The book begins with an introduction to some of the basic concepts and results on chaotic dynamical systems. Next it turns to a detailed self-contained summary of the literature on discounted dynamic optimization. The first two chapters are of particular pedagogical interest. The volume also brings together a number of outstanding advanced research papers on complex behavior of dynamic economic models. These make it clear that complexity cannot be dismissed as "exceptional" or "pathological" and, for explanation and prediction of economic variables, it is imperative to develop models with special structures suggested by empirical studies. Graduate students in economics will find the book valuable for an introduction to optimization and chaos. Specialists will find new directions to explore themes like robustness of chaotic behavior and the role of discounting in generating cycles and complexity.

This book explores fundamental aspects of geometric network optimisation with applications to a variety of real world problems. It presents, for the first time in the literature, a cohesive mathematical framework within which the properties of such optimal interconnection networks can be understood across a wide range of metrics and cost functions. The book makes use of this mathematical theory to develop efficient algorithms for constructing such networks, with an emphasis on exact solutions. Marcus Brazil and Martin Zachariasen focus principally on the geometric structure of optimal interconnection networks, also known as Steiner trees, in the plane. They show readers how an understanding of this structure can lead to practical exact algorithms for constructing such trees. The book also details numerous breakthroughs in this area over the past 20 years, features clearly written proofs, and is supported by 135 colour and 15 black and white figures. It will help graduate students, working mathematicians, engineers and computer scientists to understand the principles required for designing interconnection networks in the plane that are as cost efficient as possible.

This book examines the main methodological and theoretical developments in stochastic global optimization. It is designed to inspire readers to explore various stochastic methods of global optimization by clearly explaining the main methodological principles and features of the methods. Among the book's features is a comprehensive study of probabilistic and statistical models underlying the stochastic optimization algorithms.

Variational principles have proven to be surprisingly fertile. For example, Fermat used variational methods to demonstrate that light follows the fastest route from one point to another, an idea which came to be a cornerstone of geometrical optics. This book explains variational principles and charts their use throughout modern physics. It examines the analytical mechanics of Lagrange and Hamilton, the basic tools of any physicist. The book also offers simple but rich first impressions of Einstein’s General Relativity, Feynman’s Quantum Mechanics, and more that reveal amazing interconnections between various fields of physics.

The field of global optimization has been developing at a rapid pace. There is a journal devoted to the topic, as well as many publications and notable books discussing various aspects of global optimization. This book is intended to complement these other publications with a focus on stochastic methods for global optimization. Stochastic methods, such as simulated annealing and genetic algo rithms, are gaining in popularity among practitioners and engineers be they are relatively easy to program on a computer and may be cause applied to a broad class of global optimization problems. However, the theoretical performance of these stochastic methods is not well under stood. In this book, an attempt is made to describe the theoretical prop erties of several stochastic adaptive search methods. Such a theoretical understanding may allow us to better predict algorithm performance and ultimately design new and improved algorithms. This book consolidates a collection of papers on the analysis and de velopment of stochastic adaptive search. The first chapter introduces random search algorithms. Chapters 2-5 describe the theoretical anal ysis of a progression of algorithms. A main result is that the expected number of iterations for pure adaptive search is linear in dimension for a class of Lipschitz global optimization problems. Chapter 6 discusses algorithms, based on the Hit-and-Run sampling method, that have been developed to approximate the ideal performance of pure random search. The final chapter discusses several applications in engineering that use stochastic adaptive search methods."

The scope of this volume is primarily to analyze from different methodological perspectives similar valuation and optimization problems arising in financial applications, aimed at facilitating a theoretical and computational integration between methods largely regarded as alternatives. Increasingly in recent years, financial management problems such as strategic asset allocation, asset-liability management, as well as asset pricing problems, have been presented in the literature adopting formulation and solution approaches rooted in stochastic programming, robust optimization, stochastic dynamic programming (including approximate SDP) methods, as well as policy rule optimization, heuristic approaches and others. The aim of the volume is to facilitate the comprehension of the modeling and methodological potentials of those methods, thus their common assumptions and peculiarities, relying on similar financial problems. The volume will address different valuation problems common in finance related to: asset pricing, optimal portfolio management, risk measurement, risk control and asset-liability management.The volume features chapters of theoretical and practical relevance clarifying recent advances in the associated applied field from different standpoints, relying on similar valuation problems and, as mentioned, facilitating a mutual and beneficial methodological and theoretical knowledge transfer. The distinctive aspects of the volume can be summarized as follows: Strong benchmarking philosophy, with contributors explicitly asked to underline current limits and desirable developments in their areas. Theoretical contributions, aimed at advancing the state-of-the-art in the given domain with a clear potential for applications The inclusion of an algorithmic-computational discussion of issues arising on similar valuation problems across different methods. Variety of applications: rarely is it possible within a single volume to consider and analyze different, and possibly competing, alternative optimization techniques applied to well-identified financial valuation problems. Clear definition of the current state-of-the-art in each methodological and applied area to facilitate future research directions.

Operations research and mathematical programming would not be as advanced today without the many advances in interior point methods during the last decade. These methods can now solve very efficiently and robustly large scale linear, nonlinear and combinatorial optimization problems that arise in various practical applications. The main ideas underlying interior point methods have influenced virtually all areas of mathematical programming including: analyzing and solving linear and nonlinear programming problems, sensitivity analysis, complexity analysis, the analysis of Newton's method, decomposition methods, polynomial approximation for combinatorial problems etc. This book covers the implications of interior techniques for the entire field of mathematical programming, bringing together many results in a uniform and coherent way. For the topics mentioned above the book provides theoretical as well as computational results, explains the intuition behind the main ideas, gives examples as well as proofs, and contains an extensive up-to-date bibliography. Audience: The book is intended for students, researchers and practitioners with a background in operations research, mathematics, mathematical programming, or statistics.

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

This monograph explores a dual variational formulation of solutions to nonlinear diffusion equations with general nonlinearities as null minimizers of appropriate energy functionals. The author demonstrates how this method can be utilized as a convenient tool for proving the existence of these solutions when others may fail, such as in cases of evolution equations with nonautonomous operators, with low regular data, or with singular diffusion coefficients. By reducing it to a minimization problem, the original problem is transformed into an optimal control problem with a linear state equation. This procedure simplifies the proof of the existence of minimizers and, in particular, the determination of the first-order conditions of optimality. The dual variational formulation is illustrated in the text with specific diffusion equations that have general nonlinearities provided by potentials having various stronger or weaker properties. These equations can represent mathematical models to various real-world physical processes. Inverse problems and optimal control problems are also considered, as this technique is useful in their treatment as well.

This text provides the undergraduate chemical engineering student with the necessary tools for problem solving in chemical or bio-engineering processes. In a friendly, simple, and unified framework, the exposition aptly balances theory and practice. It uses minimal mathematical concepts, terms, algorithms, and describes the main aspects of chemical process optimization using MATLAB and GAMS. Numerous examples and case studies are designed for students to understand basic principles of each optimization method and elicit the immediate discovery of practical applications. Problem sets are directly tied to real-world situations most commonly encountered in chemical engineering applications. Chapters are structured with handy learning summaries, terms and concepts, and problem sets, and individually reinforce the basics of particular optimization methods. Additionally, the wide breadth of topics that may be encountered in courses such as Chemical Process Optimization, Chemical Process Engineering, Optimization of Chemical Processes, are covered in this accessible text. The book provides formal introductions to MATLAB, GAMS, and a revisit to pertinent aspects of undergraduate calculus. While created for coursework, this text is also suitable for independent study. A full solutions manual is available to instructors who adopt the text for their course.

This text provides deep and comprehensive coverage of the mathematical background for data science, including machine learning, optimal recovery, compressed sensing, optimization, and neural networks. In the past few decades, heuristic methods adopted by big tech companies have complemented existing scientific disciplines to form the new field of Data Science. This text embarks the readers on an engaging itinerary through the theory supporting the field. Altogether, twenty-seven lecture-length chapters with exercises provide all the details necessary for a solid understanding of key topics in data science. While the book covers standard material on machine learning and optimization, it also includes distinctive presentations of topics such as reproducing kernel Hilbert spaces, spectral clustering, optimal recovery, compressed sensing, group testing, and applications of semidefinite programming. Students and data scientists with less mathematical background will appreciate the appendices that provide more background on some of the more abstract concepts.

This book is a rigorous but practical presentation of the techniques of uncertainty quantification, with applications in R and Python. This volume includes mathematical arguments at the level necessary to make the presentation rigorous and the assumptions clearly established, while maintaining a focus on practical applications of uncertainty quantification methods. Practical aspects of applied probability are also discussed, making the content accessible to students. The introduction of R and Python allows the reader to solve more complex problems involving a more significant number of variables. Users will be able to use examples laid out in the text to solve medium-sized problems. The list of topics covered in this volume includes linear and nonlinear programming, Lagrange multipliers (for sensitivity), multi-objective optimization, game theory, as well as linear algebraic equations, and probability and statistics. Blending theoretical rigor and practical applications, this volume will be of interest to professionals, researchers, graduate and undergraduate students interested in the use of uncertainty quantification techniques within the framework of operations research and mathematical programming, for applications in management and planning.

The author of this book made an attempt to create the general theory of optimization of linear systems (both distributed and lumped) with a singular control. The book touches upon a wide range of issues such as solvability of boundary values problems for partial differential equations with generalized right-hand sides, the existence of optimal controls, the necessary conditions of optimality, the controllability of systems, numerical methods of approximation of generalized solutions of initial boundary value problems with generalized data, and numerical methods for approximation of optimal controls. In particular, the problems of optimization of linear systems with lumped controls (pulse, point, pointwise, mobile and so on) are investigated in detail.

This volume highlights contributions of women mathematicians in the study of complex materials and includes both original research papers and reviews. The featured topics and methods draw on the fields of Calculus of Variations, Partial Differential Equations, Functional Analysis, Differential Geometry and Topology, as well as Numerical Analysis and Mathematical Modelling. Areas of applications include foams, fluid-solid interactions, liquid crystals, shape-memory alloys, magnetic suspensions, failure in solids, plasticity, viscoelasticity, homogenization, crystallization, grain growth, and phase-field models.

The research of Antanas Zilinskas has focused on developing models for global optimization, implementing and investigating the corresponding algorithms, and applying those algorithms to practical problems. This volume, dedicated to Professor Zilinskas on the occasion of his 60th birthday, contains new survey papers in which leading researchers from the field present various models and algorithms for solving global optimization problems.

Contains case studies from engineering and operations research

Includes commented literature for each chapter

This volume provides updated, in-depth material on the application of intelligent optimization in biology and medicine. The aim of the book is to present solutions to the challenges and problems facing biology and medicine applications. This Volume comprises of 13 chapters, including an overview chapter, providing an up-to-date and state-of-the research on the application of intelligent optimization for bioinformatics applications, DNA based Steganography, a modified Particle Swarm Optimization Algorithm for Solving Capacitated Maximal Covering Location Problem in Healthcare Systems, Optimization Methods for Medical Image Super Resolution Reconstruction and breast cancer classification. Moreover, some chapters that describe several bio-inspired approaches in MEDLINE Text Mining, DNA-Binding Proteins and Classes, Optimized Tumor Breast Cancer Classification using Combining Random Subspace and Static Classifiers Selection Paradigms, and Dental Image Registration. The book will be a useful compendium for a broad range of readers-from students of undergraduate to postgraduate levels and also for researchers, professionals, etc.-who wish to enrich their knowledge on Intelligent Optimization in Biology and Medicine and applications with one single book.

This book presents the best papers from the 3rd International Conference on Mathematical Research for Blockchain Economy (MARBLE) 2022, held in Vilamoura, Portugal. While most blockchain conferences and forums are dedicated to business applications, product development or Initial Coin Offering (ICO) launches, this conference focuses on the mathematics behind blockchain to bridge the gap between practice and theory. Blockchain Technology has been considered as the most fundamental and revolutionising invention since the Internet. Every year, thousands of blockchain projects are launched and circulated in the market, and there is a tremendous wealth of blockchain applications, from finance to healthcare, education, media, logistics and more. However, due to theoretical and technical barriers, most of these applications are impractical for use in a real-world business context. The papers in this book reveal the challenges and limitations, such as scalability, latency, privacy and security, and showcase solutions and developments to overcome them.

In the fifties and sixties, several real problems, old and new, especially in Physics, Mechanics, Fluidodynamics, Structural Engi- neering, have shown the need of new mathematical models for study- ing the equilibrium of a system. This has led to the formulation of Variational Inequalities (by G. Stampacchia), and to the develop- ment of Complementarity Systems (by W.S. Dorn, G.B. Dantzig, R.W. Cottle, O.L. Mangasarian et al.) with important applications in the elasto-plastic field (initiated by G. Maier). The great advan- tage of these models is that the equilibrium is not necessarily the extremum of functional, like energy, so that no such functional must be supposed to exist. In the same decades, in some fields like Control Theory, Net- works, Industrial Systems, Logistics, Management Science, there has been a strong request of mathmatical models for optimizing situa- tions where there are concurrent objectives, so that Vector Optimiza- tion (initiated by W. Pareto) has received new impetus. With regard to equilibrium problems, Vector Optimization has the above - mentioned drawback of being obliged to assume the exis- tence of a (vector) functional. Therefore, at the end of the seventies the study of Vector Variational Inequalities began with the scope of exploiting the advantages of both variational and vector models. This volume puts together most of the recent mathematical results in Vector Variational Inequalities with the purpose of contributing to further research.

This book presents the development of an optimization platform for geotechnical engineering, which is one of the key components in smart geotechnics. The book discusses the fundamentals of the optimization algorithm with constitutive models of soils. Helping readers easily understand the optimization algorithm applied in geotechnical engineering, this book first introduces the methodology of the optimization-based parameter identification, and then elaborates the principle of three newly developed efficient optimization algorithms, followed by the ideas of a variety of laboratory tests and formulations of constitutive models. Moving on to the application of optimization methods in geotechnical engineering, this book presents an optimization-based parameter identification platform with a practical and concise interface based on the above theories. The book is intended for undergraduate and graduate-level teaching in soil mechanics and geotechnical engineering and other related engineering specialties. It is also of use to industry practitioners, due to the inclusion of real-world applications, opening the door to advanced courses on both modeling and algorithm development within the industrial engineering and operations research fields.