Download or read book Chance Constrained Optimization with Robust and Sampling Approximation written by Zhuangzhi Li and published by . This book was released on 2015 with total page 110 pages. Available in PDF, EPUB and Kindle. Book excerpt: Uncertainty is pervasive in various process operations problems. Its appearance spans from the detailed process description of multi-site manufacturing. In practical applications, there is a need for making optimal and reliable decisions in the presence of uncertainties. Asking for constraint satisfaction at some level of probability is reasonable in many applications, which calls for the utilization of chance constraints. This thesis studies the approximation methods for solving the chance constrained optimization problems. Two approximation methods were considered: Robust optimization approximation and Sample average approximation. For the robust optimization approximation method, an optimal uncertainty set size identification algorithm is proposed, which can find the smallest possible uncertainty set size that leads to the least conservative robust optimization approximation. For the sample average approximation method, a new linear programming based scenario reduction method is proposed, which can reduce the number of samples used in the sample average approximation problem, thus lead to reduction of computational complexity. Furthermore, the proposed scenario reduction method is computationally more efficient than the existing methods. The effectiveness of the proposed methods is demonstrated by several case studies.

Download or read book Probabilistic and Randomized Methods for Design under Uncertainty written by Giuseppe Calafiore and published by Springer Science & Business Media. This book was released on 2006-03-06 with total page 454 pages. Available in PDF, EPUB and Kindle. Book excerpt: Probabilistic and Randomized Methods for Design under Uncertainty is a collection of contributions from the world’s leading experts in a fast-emerging branch of control engineering and operations research. The book will be bought by university researchers and lecturers along with graduate students in control engineering and operational research.

Download or read book Probabilistic Constrained Optimization written by Stanislav Uryasev and published by Springer Science & Business Media. This book was released on 2000-11-30 with total page 324 pages. Available in PDF, EPUB and Kindle. Book excerpt: Probabilistic and percentile/quantile functions play an important role in several applications, such as finance (Value-at-Risk), nuclear safety, and the environment. Recently, significant advances have been made in sensitivity analysis and optimization of probabilistic functions, which is the basis for construction of new efficient approaches. This book presents the state of the art in the theory of optimization of probabilistic functions and several engineering and finance applications, including material flow systems, production planning, Value-at-Risk, asset and liability management, and optimal trading strategies for financial derivatives (options). Audience: The book is a valuable source of information for faculty, students, researchers, and practitioners in financial engineering, operation research, optimization, computer science, and related areas.

Download or read book Approximation Algorithms for Distributionally Robust Stochastic Optimization written by André Linhares Rodrigues and published by . This book was released on 2019 with total page 149 pages. Available in PDF, EPUB and Kindle. Book excerpt: Two-stage stochastic optimization is a widely used framework for modeling uncertainty, where we have a probability distribution over possible realizations of the data, called scenarios, and decisions are taken in two stages: we take first-stage actions knowing only the underlying distribution and before a scenario is realized, and may take additional second-stage recourse actions after a scenario is realized. The goal is typically to minimize the total expected cost. A common criticism levied at this model is that the underlying probability distribution is itself often imprecise. To address this, an approach that is quite versatile and has gained popularity in the stochastic-optimization literature is the two-stage distributionally robust stochastic model: given a collection D of probability distributions, our goal now is to minimize the maximum expected total cost with respect to a distribution in D. There has been almost no prior work however on developing approximation algorithms for distributionally robust problems where the underlying scenario collection is discrete, as is the case with discrete-optimization problems. We provide frameworks for designing approximation algorithms in such settings when the collection D is a ball around a central distribution, defined relative to two notions of distance between probability distributions: Wasserstein metrics (which include the L_1 metric) and the L_infinity metric. Our frameworks yield efficient algorithms even in settings with an exponential number of scenarios, where the central distribution may only be accessed via a sampling oracle. For distributionally robust optimization under a Wasserstein ball, we first show that one can utilize the sample average approximation (SAA) method (solve the distributionally robust problem with an empirical estimate of the central distribution) to reduce the problem to the case where the central distribution has a polynomial-size support, and is represented explicitly. This follows because we argue that a distributionally robust problem can be reduced in a novel way to a standard two-stage stochastic problem with bounded inflation factor, which enables one to use the SAA machinery developed for two-stage stochastic problems. Complementing this, we show how to approximately solve a fractional relaxation of the SAA problem (i.e., the distributionally robust problem obtained by replacing the original central distribution with its empirical estimate). Unlike in two-stage {stochastic, robust} optimization with polynomially many scenarios, this turns out to be quite challenging. We utilize a variant of the ellipsoid method for convex optimization in conjunction with several new ideas to show that the SAA problem can be approximately solved provided that we have an (approximation) algorithm for a certain max-min problem that is akin to, and generalizes, the k-max-min problem (find the worst-case scenario consisting of at most k elements) encountered in two-stage robust optimization. We obtain such an algorithm for various discrete-optimization problems; by complementing this via rounding algorithms that provide local (i.e., per-scenario) approximation guarantees, we obtain the first approximation algorithms for the distributionally robust versions of a variety of discrete-optimization problems including set cover, vertex cover, edge cover, facility location, and Steiner tree, with guarantees that are, except for set cover, within O(1)-factors of the guarantees known for the deterministic version of the problem. For distributionally robust optimization under an L_infinity ball, we consider a fractional relaxation of the problem, and replace its objective function with a proxy function that is pointwise close to the true objective function (within a factor of 2). We then show that we can efficiently compute approximate subgradients of the proxy function, provided that we have an algorithm for the problem of computing the t worst scenarios under a given first-stage decision, given an integer t. We can then approximately minimize the proxy function via a variant of the ellipsoid method, and thus obtain an approximate solution for the fractional relaxation of the distributionally robust problem. Complementing this via rounding algorithms with local guarantees, we obtain approximation algorithms for distributionally robust versions of various covering problems, including set cover, vertex cover, edge cover, and facility location, with guarantees that are within O(1)-factors of the guarantees known for their deterministic versions.

Download or read book Data Driven Distributionally Robust Chance Constrained Optimization With Wasserstein Metric written by Ran Ji and published by . This book was released on 2020 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: We study distributionally robust chance-constrained programming (DRCCP) optimization problems with data-driven Wasserstein ambiguity sets. The proposed algorithmic and reformulation framework applies to distributionally robust optimization problems subjected to individual as well as joint chance constraints, with random right-hand side and technology vector, and under two types of uncertainties, called uncertain probabilities and continuum of realizations. For the uncertain probabilities case, we provide new mixed-integer linear programming reformulations for DRCCP problems and derive a set of precedence optimality cuts to strengthen the formulations. For the continuum of realizations case with random right-hand side, we propose an exact mixed-integer second-order cone programming (MISOCP) reformulation and a linear programming (LP) outer approximation. For the continuum of realizations case with random technology vector, we propose two MISOCP and LP outer approximations. We show that all proposed relaxations become exact reformulations when the decision variables are binary or bounded general integers. We evaluate the scalability and tightness of the proposed MISOCP and (MI)LP formulations on a distributionally robust chance constrained knapsack problem.

Download or read book Randomized Algorithms for Analysis and Control of Uncertain Systems written by Roberto Tempo and published by Springer Science & Business Media. This book was released on 2012-10-21 with total page 363 pages. Available in PDF, EPUB and Kindle. Book excerpt: The presence of uncertainty in a system description has always been a critical issue in control. The main objective of Randomized Algorithms for Analysis and Control of Uncertain Systems, with Applications (Second Edition) is to introduce the reader to the fundamentals of probabilistic methods in the analysis and design of systems subject to deterministic and stochastic uncertainty. The approach propounded by this text guarantees a reduction in the computational complexity of classical control algorithms and in the conservativeness of standard robust control techniques. The second edition has been thoroughly updated to reflect recent research and new applications with chapters on statistical learning theory, sequential methods for control and the scenario approach being completely rewritten. Features: · self-contained treatment explaining Monte Carlo and Las Vegas randomized algorithms from their genesis in the principles of probability theory to their use for system analysis; · development of a novel paradigm for (convex and nonconvex) controller synthesis in the presence of uncertainty and in the context of randomized algorithms; · comprehensive treatment of multivariate sample generation techniques, including consideration of the difficulties involved in obtaining identically and independently distributed samples; · applications of randomized algorithms in various endeavours, such as PageRank computation for the Google Web search engine, unmanned aerial vehicle design (both new in the second edition), congestion control of high-speed communications networks and stability of quantized sampled-data systems. Randomized Algorithms for Analysis and Control of Uncertain Systems (second edition) is certain to interest academic researchers and graduate control students working in probabilistic, robust or optimal control methods and control engineers dealing with system uncertainties. The present book is a very timely contribution to the literature. I have no hesitation in asserting that it will remain a widely cited reference work for many years. M. Vidyasagar

Download or read book Robust Optimization written by Aharon Ben-Tal and published by Princeton University Press. This book was released on 2009-08-10 with total page 565 pages. Available in PDF, EPUB and Kindle. Book excerpt: Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering this powerful methodology. Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and up-to-date account of the subject. Robust optimization is designed to meet some major challenges associated with uncertainty-affected optimization problems: to operate under lack of full information on the nature of uncertainty; to model the problem in a form that can be solved efficiently; and to provide guarantees about the performance of the solution. The book starts with a relatively simple treatment of uncertain linear programming, proceeding with a deep analysis of the interconnections between the construction of appropriate uncertainty sets and the classical chance constraints (probabilistic) approach. It then develops the robust optimization theory for uncertain conic quadratic and semidefinite optimization problems and dynamic (multistage) problems. The theory is supported by numerous examples and computational illustrations. An essential book for anyone working on optimization and decision making under uncertainty, Robust Optimization also makes an ideal graduate textbook on the subject.

Download or read book Lectures on Stochastic Programming written by Alexander Shapiro and published by SIAM. This book was released on 2009-01-01 with total page 447 pages. Available in PDF, EPUB and Kindle. Book excerpt: Optimization problems involving stochastic models occur in almost all areas of science and engineering, such as telecommunications, medicine, and finance. Their existence compels a need for rigorous ways of formulating, analyzing, and solving such problems. This book focuses on optimization problems involving uncertain parameters and covers the theoretical foundations and recent advances in areas where stochastic models are available. Readers will find coverage of the basic concepts of modeling these problems, including recourse actions and the nonanticipativity principle. The book also includes the theory of two-stage and multistage stochastic programming problems; the current state of the theory on chance (probabilistic) constraints, including the structure of the problems, optimality theory, and duality; and statistical inference in and risk-averse approaches to stochastic programming.

Download or read book Convex Approximation of Chance Constrained Optimization Problems written by Ashkan Mohammadzadeh Jasour and published by . This book was released on 2017 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: This dissertation concentrates on chance constrained optimization problems and their application in systems and control area. In chance optimization problems, we aim at maximizing the probability of a set defined by polynomial inequalities involving decision and uncertain parameters. These problems are, in general, nonconvex and computationally hard. With the objective of developing systematic numerical procedures to solve such problems, a sequence of convex relaxations based on the theory of measures and moments is provided, whose sequence of optimal values is shown to converge to the optimal valueof the original problem. Indeed, we provide a sequence of semidefinite programs of increasing dimensionwhich can arbitrarily approximate the solution of the original problem. In addition, we apply obtained results on chance optimization problems to challenging problems in the area of systems, control and data science.We consider the problem of probabilistic control of uncertain systems to ensure that the probability of defined failure/success is minimized/maximized. In particular, we consider the probabilistic robust control and chance constrained model predictive control problems. We also use the obtained results to analysis of stochastic and deterministic systems. More precisely, we address the problem of uncertainty set propagation and computing invariant robust set for uncertain systems and problem of computing region of attraction set for deterministic systems. In the problem of uncertainty propagation, we propagate the set of initial sets through uncertain dynamical systems and find the uncertainty set of states of the system for given time step. In the problem of region of attraction and invariant robust set, we aim at finding the largest set of all initial states whose trajectories converge to the origin. Moreover, we present the problem of corrupted and sparse data reconstruction where we want to complete the data with least possible complexity. In this thesis, to be able to efficiently solve the resulting large-scale problems, a first-order augmented Lagrangian algorithm is also implemented. Numerical examples are presented to illustrate the computational performance ofthe proposed approach.

Download or read book Frontiers in PDE Constrained Optimization written by Harbir Antil and published by Springer. This book was released on 2018-10-12 with total page 434 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume provides a broad and uniform introduction of PDE-constrained optimization as well as to document a number of interesting and challenging applications. Many science and engineering applications necessitate the solution of optimization problems constrained by physical laws that are described by systems of partial differential equations (PDEs)​. As a result, PDE-constrained optimization problems arise in a variety of disciplines including geophysics, earth and climate science, material science, chemical and mechanical engineering, medical imaging and physics. This volume is divided into two parts. The first part provides a comprehensive treatment of PDE-constrained optimization including discussions of problems constrained by PDEs with uncertain inputs and problems constrained by variational inequalities. Special emphasis is placed on algorithm development and numerical computation. In addition, a comprehensive treatment of inverse problems arising in the oil and gas industry is provided. The second part of this volume focuses on the application of PDE-constrained optimization, including problems in optimal control, optimal design, and inverse problems, among other topics.

Download or read book First order and Stochastic Optimization Methods for Machine Learning written by Guanghui Lan and published by Springer Nature. This book was released on 2020-05-15 with total page 591 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book covers not only foundational materials but also the most recent progresses made during the past few years on the area of machine learning algorithms. In spite of the intensive research and development in this area, there does not exist a systematic treatment to introduce the fundamental concepts and recent progresses on machine learning algorithms, especially on those based on stochastic optimization methods, randomized algorithms, nonconvex optimization, distributed and online learning, and projection free methods. This book will benefit the broad audience in the area of machine learning, artificial intelligence and mathematical programming community by presenting these recent developments in a tutorial style, starting from the basic building blocks to the most carefully designed and complicated algorithms for machine learning.

Download or read book Uncertainty in Complex Networked Systems written by Tamer Başar and published by Springer. This book was released on 2018-12-14 with total page 618 pages. Available in PDF, EPUB and Kindle. Book excerpt: The chapters in this volume, and the volume itself, celebrate the life and research of Roberto Tempo, a leader in the study of complex networked systems, their analysis and control under uncertainty, and robust designs. Contributors include authorities on uncertainty in systems, robustness, networked and network systems, social networks, distributed and randomized algorithms, and multi-agent systems—all fields that Roberto Tempo made vital contributions to. Additionally, at least one author of each chapter was a research collaborator of Roberto Tempo’s. This volume is structured in three parts. The first covers robustness and includes topics like time-invariant uncertainties, robust static output feedback design, and the uncertainty quartet. The second part is focused on randomization and probabilistic methods, which covers topics such as compressive sensing, and stochastic optimization. Finally, the third part deals with distributed systems and algorithms, and explores matters involving mathematical sociology, fault diagnoses, and PageRank computation. Each chapter presents exposition, provides new results, and identifies fruitful future directions in research. This book will serve as a valuable reference volume to researchers interested in uncertainty, complexity, robustness, optimization, algorithms, and networked systems.

Download or read book The Concentration of Measure Phenomenon written by Michel Ledoux and published by American Mathematical Soc.. This book was released on 2001 with total page 194 pages. Available in PDF, EPUB and Kindle. Book excerpt: The observation of the concentration of measure phenomenon is inspired by isoperimetric inequalities. This book offers the basic techniques and examples of the concentration of measure phenomenon. It presents concentration functions and inequalities, isoperimetric and functional examples, spectrum and topological applications and product measures.

Download or read book Introduction to Stochastic Search and Optimization written by James C. Spall and published by John Wiley & Sons. This book was released on 2005-03-11 with total page 620 pages. Available in PDF, EPUB and Kindle. Book excerpt: * Unique in its survey of the range of topics. * Contains a strong, interdisciplinary format that will appeal to both students and researchers. * Features exercises and web links to software and data sets.

Download or read book Applications of Operational Research and Mathematical Models in Management written by Miltiadis Chalikias and published by MDPI. This book was released on 2020-11-17 with total page 182 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book, Applications of Operational Research and Mathematical Models in Management, includes all the papers published in the Mathematics Special Issue with the same title. All the published papers are of high quality and were subjected to rigorous peer review. Mathematics is included in the Science Citation Index (Web of Science), and its current Impact Factor is 1.747. The papers in this book deal with on R&D performance models, methods for ranking the perspectives and indicators of a balance scorecard, robust optimization model applications, integrated production and distribution problem solving, demand functions, supply chain games, probabilistic optimization and profit research, coordinated techniques for order preference, robustness approaches in bank capital optimization, and hybrid methods for tourism demand forecasting. All the papers included contribute to the development of research.

Download or read book Uncertainty aware Integration of Control with Process Operations and Multi parametric Programming Under Global Uncertainty written by Vassilis M. Charitopoulos and published by Springer Nature. This book was released on 2020-02-05 with total page 285 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book introduces models and methodologies that can be employed towards making the Industry 4.0 vision a reality within the process industries, and at the same time investigates the impact of uncertainties in such highly integrated settings. Advances in computing power along with the widespread availability of data have led process industries to consider a new paradigm for automated and more efficient operations. The book presents a theoretically proven optimal solution to multi-parametric linear and mixed-integer linear programs and efficient solutions to problems such as process scheduling and design under global uncertainty. It also proposes a systematic framework for the uncertainty-aware integration of planning, scheduling and control, based on the judicious coupling of reactive and proactive methods. Using these developments, the book demonstrates how the integration of different decision-making layers and their simultaneous optimisation can enhance industrial process operations and their economic resilience in the face of uncertainty.

Download or read book Robustness Analysis in Decision Aiding Optimization and Analytics written by Michael Doumpos and published by Springer. This book was released on 2016-07-12 with total page 337 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book provides a broad coverage of the recent advances in robustness analysis in decision aiding, optimization, and analytics. It offers a comprehensive illustration of the challenges that robustness raises in different operations research and management science (OR/MS) contexts and the methodologies proposed from multiple perspectives. Aside from covering recent methodological developments, this volume also features applications of robust techniques in engineering and management, thus illustrating the robustness issues raised in real-world problems and their resolution within advances in OR/MS methodologies. Robustness analysis seeks to address issues by promoting solutions, which are acceptable under a wide set of hypotheses, assumptions and estimates. In OR/MS, robustness has been mostly viewed in the context of optimization under uncertainty. Several scholars, however, have emphasized the multiple facets of robustness analysis in a broader OR/MS perspective that goes beyond the traditional framework, seeking to cover the decision support nature of OR/MS methodologies as well. As new challenges emerge in a “big-data'” era, where the information volume, speed of flow, and complexity increase rapidly, and analytics play a fundamental role for strategic and operational decision-making at a global level, robustness issues such as the ones covered in this book become more relevant than ever for providing sound decision support through more powerful analytic tools.