This textbook offers graduate students a concise introduction to the classic notions of convex optimization. Written in a highly accessible style and including numerous examples and illustrations, it presents everything readers need to know about convexity and convex optimization. The book introduces a systematic three-step method for doing everything, which can be summarized as "conify, work, deconify". It starts with the concept of convex sets, their primal description, constructions, topological properties and dual description, and then moves on to convex functions and the fundamental principles of convex optimization and their use in the complete analysis of convex optimization problems by means of a systematic four-step method. Lastly, it includes chapters on alternative formulations of optimality conditions and on illustrations of their use. "The author deals with the delicate subjects in a precise yet light-minded spirit... For experts in the field, this book not only offers a unifying view, but also opens a door to new discoveries in convexity and optimization...perfectly suited for classroom teaching." Shuzhong Zhang, Professor of Industrial and Systems Engineering, University of Minnesota

Complex Social Networks is a newly emerging (hot) topic with applications in a variety of domains, such as communication networks, engineering networks, social networks, and biological networks. In the last decade, there has been an explosive growth of research on complex real-world networks, a theme that is becoming pervasive in many disciplines, ranging from mathematics and computer science to the social and biological sciences. Optimization of complex communication networks requires a deep understanding of the interplay between the dynamics of the physical network and the information dynamics within the network. Although there are a few books addressing social networks or complex networks, none of them has specially focused on the optimization perspective of studying these networks. This book provides the basic theory of complex networks with several new mathematical approaches and optimization techniques to design and analyze dynamic complex networks. A wide range of applications and optimization problems derived from research areas such as cellular and molecular chemistry, operations research, brain physiology, epidemiology, and ecology.

Throughout the evolutionary history of this planet, biological systems have been able to adapt, survive and ?ourish despite the turmoils and upheavals of the environment. This ability has long fascinated and inspired people to emulate and adapt natural processes for application in the arti?cial world of human endeavours. The realm of optimisation problems is no exception. In fact, in recent years biological systems have been the inspiration of the majority of meta-heuristic search algorithms including, but not limited to, genetic algorithms, particle swarmoptimisation, ant colony optimisation and extremal optimisation. This book presentsa continuum ofbiologicallyinspired optimisation, from the theoretical to the practical. We begin with an overview of the ?eld of biologically-inspired optimisation, progress to presentation of theoretical analysesandrecentextensionstoavarietyofmeta-heuristicsand?nallyshow application to a number of real-worldproblems. As such, it is anticipated the book will provide a useful resource for reseachers and practitioners involved in any aspect of optimisation problems. The overviewof the ?eld is provided by two works co-authored by seminal thinkers in the ?eld. Deb's "Evolution's Niche in Multi-Criterion Problem Solving," presents a very comprehensive and complete overview of almost all major issues in Evolutionary Multi-objective Optimisation (EMO). This chapter starts with the original motivation for developing EMO algorithms and provides an account of some successful problem domains on which EMO has demonstrated a clear edge over their classical counterparts.

This is the first of three volumes providing a comprehensive presentation of the fundamentals of scientific computing. This volume discusses basic principles of computation, and fundamental numerical algorithms that will serve as basic tools for the subsequent two volumes. This book and its companions show how to determine the quality of computational results, and how to measure the relative efficiency of competing methods. Readers learn how to determine the maximum attainable accuracy of algorithms, and how to select the best method for computing problems. This book also discusses programming in several languages, including C++, Fortran and MATLAB. There are 80 examples, 324 exercises, 77 algorithms, 35 interactive JavaScript programs, 391 references to software programs and 4 case studies. Topics are introduced with goals, literature references and links to public software. There are descriptions of the current algorithms in LAPACK, GSLIB and MATLAB. This book could be used for an introductory course in numerical methods, for either upper level undergraduates or first year graduate students. Parts of the text could be used for specialized courses, such as principles of computer languages or numerical linear algebra.

Give Your Students the Proper Groundwork for Future Studies in Optimization A First Course in Optimization is designed for a one-semester course in optimization taken by advanced undergraduate and beginning graduate students in the mathematical sciences and engineering. It teaches students the basics of continuous optimization and helps them better understand the mathematics from previous courses. The book focuses on general problems and the underlying theory. It introduces all the necessary mathematical tools and results. The text covers the fundamental problems of constrained and unconstrained optimization as well as linear and convex programming. It also presents basic iterative solution algorithms (such as gradient methods and the Newton-Raphson algorithm and its variants) and more general iterative optimization methods. This text builds the foundation to understand continuous optimization. It prepares students to study advanced topics found in the author's companion book, Iterative Optimization in Inverse Problems, including sequential unconstrained iterative optimization methods.

This monograph collects cutting-edge results and techniques for solving nonlinear partial differential equations using critical points. Including many of the author's own contributions, a range of proofs are conveniently collected here, Because the material is approached with rigor, this book will serve as an invaluable resource for exploring recent developments in this active area of research, as well as the numerous ways in which critical point theory can be applied. Different methods for finding critical points are presented in the first six chapters. The specific situations in which these methods are applicable is explained in detail. Focus then shifts toward the book's main subject: applications to problems in mathematics and physics. These include topics such as Schroedinger equations, Hamiltonian systems, elliptic systems, nonlinear wave equations, nonlinear optics, semilinear PDEs, boundary value problems, and equations with multiple solutions. Readers will find this collection of applications convenient and thorough, with detailed proofs appearing throughout. Critical Point Theory will be ideal for graduate students and researchers interested in solving differential equations, and for those studying variational methods. An understanding of fundamental mathematical analysis is assumed. In particular, the basic properties of Hilbert and Banach spaces are used.

DLP denotes a dynamic-linear modeling and optimization approach to computational decision support for resource planning problems that arise, typically, within the natural resource sciences and the disciplines of operations research and operational engineering. It integrates techniques of dynamic programming (DP) and linear programming (LP) and can be realized in an immediate, practical and usable way. Simultaneously DLP connotes a broad and very general modeling/ algorithmic concept that has numerous areas of application and possibilities for extension. Two motivating examples provide a linking thread through the main chapters, and an appendix provides a demonstration program, executable on a PC, for hands-on experience with the DLP approach.

Optimal Design for Nonlinear Response Models discusses the theory and applications of model-based experimental design with a strong emphasis on biopharmaceutical studies. The book draws on the authors' many years of experience in academia and the pharmaceutical industry. While the focus is on nonlinear models, the book begins with an explanation of the key ideas, using linear models as examples. Applying the linearization in the parameter space, it then covers nonlinear models and locally optimal designs as well as minimax, optimal on average, and Bayesian designs. The authors also discuss adaptive designs, focusing on procedures with non-informative stopping. The common goals of experimental design-such as reducing costs, supporting efficient decision making, and gaining maximum information under various constraints-are often the same across diverse applied areas. Ethical and regulatory aspects play a much more prominent role in biological, medical, and pharmaceutical research. The authors address all of these issues through many examples in the book.

In this book, the theory, methods and applications of separable optimization are considered. Some general results are presented, techniques of approximating the separable problem by linear programming problem, and dynamic programming are also studied. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and convergent iterative algorithms of polynomial complexity are proposed. As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. The problems of numerical approximation of tabulated functions and numerical solution of overdetermined systems of linear algebraic equations and some systems of nonlinear equations are solved by separable convex unconstrained minimization problems. Some properties of the Knapsack polytope are also studied. This second edition includes a substantial amount of new and revised content. Three new chapters, 15-17, are included. Chapters 15-16 are devoted to the further analysis of the Knapsack problem. Chapter 17 is focused on the analysis of a nonlinear transportation problem. Three new Appendices (E-G) are also added to this edition and present technical details that help round out the coverage. Optimization problems and methods for solving the problems considered are interesting not only from the viewpoint of optimization theory, optimization methods and their applications, but also from the viewpoint of other fields of science, especially the artificial intelligence and machine learning fields within computer science. This book is intended for the researcher, practitioner, or engineer who is interested in the detailed treatment of separable programming and wants to take advantage of the latest theoretical and algorithmic results. It may also be used as a textbook for a special topics course or as a supplementary textbook for graduate courses on nonlinear and convex optimization.

This book, based on a selection of talks given at a dedicated meeting in Cortona, Italy, in June 2013, shows the high degree of interaction between a number of fields related to applied sciences. Applied sciences consider situations in which the evolution of a given system over time is observed, and the related models can be formulated in terms of evolution equations (EEs). These equations have been studied intensively in theoretical research and are the source of an enormous number of applications. In this volume, particular attention is given to direct, inverse and control problems for EEs. The book provides an updated overview of the field, revealing its richness and vitality.

Providing readers with a detailed examination of resilient controls in risk-averse decision, this monograph is aimed toward researchers and graduate students in applied mathematics and electrical engineering with a systems-theoretic concentration. This work contains a timely and responsive evaluation of reforms on the use of asymmetry or skewness pertaining to the restrictive family of quadratic costs that have been appeared in various scholarly forums. Additionally, the book includes a discussion of the current and ongoing efforts in the usage of risk, dynamic game decision optimization and disturbance mitigation techniques with output feedback measurements tailored toward the worst-case scenarios. This work encompasses some of the current changes across uncertainty quantification, stochastic control communities, and the creative efforts that are being made to increase the understanding of resilient controls. Specific considerations are made in this book for the application of decision theory to resilient controls of the linear-quadratic class of stochastic dynamical systems. Each of these topics are examined explicitly in several chapters. This monograph also puts forward initiatives to reform both control decisions with risk consequences and correct-by-design paradigms for performance reliability associated with the class of stochastic linear dynamical systems with integral quadratic costs and subject to network delays, control and communication constraints.

Linear programming (LP), modeling, and optimization are very much the fundamentals of OR, and no academic program is complete without them. No matter how highly developed one 's LP skills are, however, if a fine appreciation for modeling isn t developed to make the best use of those skills, then the truly best solutions are often not realized, and efforts go wasted.

Katta Murty studied LP with George Dantzig, the father of linear programming, and has written the graduate-level solution to that problem. While maintaining the rigorous LP instruction required, Murty's new book is unique in his focus on developing modeling skills to support valid decision making for complex real world problems. He describes the approach as 'intelligent modeling and decision making' to emphasize the importance of employing the best expression of actual problems and then applying the most computationally effective and efficient solution technique for that model.

The Prisoner's Dilemma is one of the most fiercely debated thought experiments in philosophy and the social sciences, presenting the simple insight that when two or more agents interact, the actions that most benefit each individual may not benefit the group. The fact that when you do what is best for you, and I do what is best for me, we end up in a situation that is worse for both of us makes the Prisoner's Dilemma relevant to a broad range of everyday phenomena. This volume of new essays from leading philosophers, game theorists, and economists examines the ramifications of the Prisoner's Dilemma, the directions in which it continues to lead us, and its links to a variety of topics in philosophy, political science, social science, economics, and evolutionary biology. The volume will be a vital and accessible resource for upper-level students as well as for academic researchers.

This book presents the latest researches on hypersonic steady glide dynamics and guidance, including the concept of steady glide reentry trajectory and the stability of its regular perturbation solutions, trajectory damping control technique for hypersonic glide reentry, singular perturbation guidance of hypersonic glide reentry, trajectory optimization based on steady glide, linear pseudospectral generalized nominal effort miss distance guidance, analytical entry guidance and trajectory-shaping guidance with final speed and load factor constraints. They can be used to solve many new difficult problems in entry guidance. And many practical engineering cases are provided for the readers for better understanding. Researchers and students in the fields of flight vehicle design or flight dynamics, guidance and control could use the book as valuable reference.

This textbook approaches optimization from a multi-aspect, multi-criteria perspective. By using a Multiple Criteria Decision Making (MCDM) approach, it avoids the limits and oversimplifications that can come with optimization models with one criterion. The book is presented in a concise form, addressing how to solve decision problems in sequences of intelligence, modelling, choice and review phases, often iterated, to identify the most preferred decision variant. The approach taken is human-centric, with the user taking the final decision is a sole and sovereign actor in the decision making process. To ensure generality, no assumption about the Decision Maker preferences or behavior is made. The presentation of these concepts is illustrated by numerous examples, figures, and problems to be solved with the help of downloadable spreadsheets. This electronic companion contains models of problems to be solved built in Excel spreadsheet files. Optimization models are too often oversimplifications of decision problems met in practice. For instance, modeling company performance by an optimization model in which the criterion function is short-term profit to be maximized, does not fully reflect the essence of business management. The company's managing staff is accountable not only for operational decisions, but also for actions which shall result in the company ability to generate a decent profit in the future. This calls for management decisions and actions which ensure short-term profitability, but also maintaining long-term relations with clients, introducing innovative products, financing long-term investments, etc. Each of those additional, though indispensable actions and their effects can be modeled separately, case by case, by an optimization model with a criterion function adequately selected. However, in each case the same set of constraints represents the range of company admissible actions. The aim and the scope of this textbook is to present methodologies and methods enabling modeling of such actions jointly.

Customer-Oriented Optimization in Public Transportation develops models, results and algorithms for optimizing public transportation from a customer-oriented point of view. The methods used are based on graph-theoretic approaches and integer programming. The specific topics are all motivated by real-world examples which occurred in practical projects. An appendix summarizes some of the basics of optimization needed to interpret the material in the book. In detail, the topics the book covers in its three parts are as follows: Stop location - Does it make sense to open new stations along existing bus or railway lines? If yes, in which locations? The problem is modeled as a continuous covering problem. To solve it, the author develops a finite dominating set and shows that efficient methods are possible if the special structure of the covering matrix is used; Delay management - Should a train wait for delayed feeder trains or should it depart in time?

Before the appearance of broadband links and wireless systems, networks have been used to connect people in new ways. Now, the modern world is connected through large-scale, computational networked systems such as the Internet. Because of the ever-advancing technology of networking, efficient algorithms have become increasingly necessary to solve some of the problems developing in this area.

"Mathematical Aspects of Network Routing Optimization" focuses on computational issues arisingfrom the process of optimizing network routes, such as quality of the resulting links and their reliability. Algorithms are a cornerstone for the understanding of the protocols underlying multicast routing. The main objectivein the text is to deriveefficient algorithms, with or without guarantee of approximation. Notes have been provided for basic topics such as graph theory and linear programming to assist those who are not fully acquainted with the mathematical topics presented throughout the book.

"Mathematical Aspects of Network Routing Optimization" provides a thorough introduction to the subject of algorithms for network routing, and focuses especially on multicast and wireless ad hoc systems. This book is designed for graduate students, researchers, and professionals interested in understanding the algorithmic and mathematical ideas behind routing in computer networks. It is suitable for advanced undergraduate students, graduate students, and researchers in the area of network algorithms."

This research monograph summarizes a line of research that maps certain classical problems of discrete mathematics and operations research - such as the Hamiltonian Cycle and the Travelling Salesman Problems - into convex domains where continuum analysis can be carried out. Arguably, the inherent difficulty of these, now classical, problems stems precisely from the discrete nature of domains in which these problems are posed. The convexification of domains underpinning these results is achieved by assigning probabilistic interpretation to key elements of the original deterministic problems. In particular, the approaches summarized here build on a technique that embeds Hamiltonian Cycle and Travelling Salesman Problems in a structured singularly perturbed Markov decision process. The unifying idea is to interpret subgraphs traced out by deterministic policies (including Hamiltonian cycles, if any) as extreme points of a convex polyhedron in a space filled with randomized policies. The above innovative approach has now evolved to the point where there are many, both theoretical and algorithmic, results that exploit the nexus between graph theoretic structures and both probabilistic and algebraic entities of related Markov chains. The latter include moments of first return times, limiting frequencies of visits to nodes, or the spectra of certain matrices traditionally associated with the analysis of Markov chains. However, these results and algorithms are dispersed over many research papers appearing in journals catering to disparate audiences. As a result, the published manuscripts are often written in a very terse manner and use disparate notation, thereby making it difficult for new researchers to make use of the many reported advances. Hence the main purpose of this book is to present a concise and yet easily accessible synthesis of the majority of the theoretical and algorithmic results obtained so far. In addition, the book discusses numerous open questions and problems that arise from this body of work and which are yet to be fully solved. The approach casts the Hamiltonian Cycle Problem in a mathematical framework that permits analytical concepts and techniques, not used hitherto in this context, to be brought to bear to further clarify both the underlying difficulty of NP-completeness of this problem and the relative exceptionality of truly difficult instances. Finally, the material is arranged in such a manner that the introductory chapters require very little mathematical background and discuss instances of graphs with interesting structures that motivated a lot of the research in this topic. More difficult results are introduced later and are illustrated with numerous examples.

Optimization on Riemannian manifolds-the result of smooth geometry and optimization merging into one elegant modern framework-spans many areas of science and engineering, including machine learning, computer vision, signal processing, dynamical systems and scientific computing. This text introduces the differential geometry and Riemannian geometry concepts that will help applied mathematics, computer science and engineering students and researchers gain a firm mathematical grounding to use these tools confidently in their research. Its chart-last approach will prove more intuitive from an optimizer's viewpoint, and all definitions and theorems are motivated to build time-tested optimization algorithms. Starting from first principles, the text goes on to cover current research on topics including worst-case complexity and geodesic convexity. Readers will appreciate the tricks of the trade for conducting research and for numerical implementations sprinkled throughout the book.

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

Effective decision-making while trading off the constraints and conflicting multiple objectives under rapid technological developments, massive generation of data, and extreme volatility is of paramount importance to organizations to win over the time-based competition today. While agility is a crucial issue, the firms have been increasingly relying on evidence-based decision-making through intelligent decision support systems driven by computational intelligence and automation to achieve a competitive advantage.  The decisions are no longer confined to a specific functional area. Instead, business organizations today find actionable insight for formulating future courses of action by integrating multiple objectives and perspectives. Therefore, multi-objective decision-making plays a critical role in businesses and industries. In this regard, the importance of Operations Research (OR) models and their applications enables the firms to derive optimum solutions subject to various constraints and/or objectives while considering multiple functional areas of the organizations together. Hence, researchers and practitioners have extensively applied OR models to solve various organizational issues related to manufacturing, service, supply chain and logistics management, human resource management, finance, and market analysis, among others. Further, OR models driven by AI have been enabled to provide intelligent decision-support frameworks for achieving sustainable development goals. The present issue provides a unique platform to showcase the contributions of the leading international experts on production systems and business from academia, industry, and government to discuss the issues in intelligent manufacturing, operations management, financial management, supply chain management, and Industry 4.0 in the Artificial Intelligence era. Some of the general (but not specific) scopes of this proceeding entail OR models such as Optimization and Control, Combinatorial Optimization, Queuing Theory, Resource Allocation Models, Linear and Nonlinear Programming Models, Multi-objective and multi-attribute Decision Models, Statistical Quality Control along with AI, Bayesian Data Analysis, Machine Learning and Econometrics and their applications vis-à-vis AI & Data-driven Production Management, Marketing and Retail Management, Financial Management, Human Resource Management, Operations Management, Smart Manufacturing & Industry 4.0, Supply Chain and Logistics Management, Digital Supply Network, Healthcare Administration, Inventory Management, consumer behavior, security analysis, and portfolio management and sustainability.   The present issue shall be of interest to the faculty members, students, and scholars of various engineering and social science institutions and universities, along with the practitioners and policymakers of different industries and organizations.

The present volume is a collective monograph devoted to applications of the optimal design theory in optimization and statistics. The chapters re?ect the topics discussed at the workshop "W-Optimum Design and Related Statistical Issues" that took place in Juan-les-Pins, France, in May 2005. The title of the workshop was chosen as a light-hearted celebration of the work of Henry Wynn. It was supported by the Laboratoire I3S (CNRS/Universit e de Nice, Sophia Antipolis), to which Henry is a frequent visitor. The topics covered partly re?ect the wide spectrum of Henry's research - terests. Algorithms for constructing optimal designs are discussed in Chap. 1, where Henry's contribution to the ?eld is acknowledged. Steepest-ascent - gorithms used to construct optimal designs are very much related to general gradientalgorithmsforconvexoptimization. Inthelasttenyears, asigni?cant part of Henry's research was devoted to the study of the asymptotic prop- ties of such algorithms. This topic is covered by Chaps. 2 and 3. The work by Alessandra Giovagnoli concentrates on the use of majorization and stoch- tic ordering, and Chap. 4 is a hopeful renewal of their collaboration. One of Henry's major recent interests is what is now called algebraic statistics, the application of computational commutative algebra to statistics, and he was partly responsible for introducing the experimental design sub-area, reviewed in Chap. 5. One other sub-area is the application to Bayesian networks and Chap. 6 covers this, with Chap. 7 being strongly related."

This book introduces the theory and applications of uncertain optimal control, and establishes two types of models including expected value uncertain optimal control and optimistic value uncertain optimal control. These models, which have continuous-time forms and discrete-time forms, make use of dynamic programming. The uncertain optimal control theory relates to equations of optimality, uncertain bang-bang optimal control, optimal control with switched uncertain system, and optimal control for uncertain system with time-delay. Uncertain optimal control has applications in portfolio selection, engineering, and games. The book is a useful resource for researchers, engineers, and students in the fields of mathematics, cybernetics, operations research, industrial engineering, artificial intelligence, economics, and management science.

"Addresses the key topic in combinatorial synthesis--how to optimize the quality of a combinatorial library--by determining the usefulness of synthesized compunds, the reliability of biological assay results, and analyzing acadmic and industrial applications, real-world examples, and case studies of successful and unsuccessful technologies."