Optimization of Chance-Constrained Submodular Functions
نویسندگان
چکیده
منابع مشابه
Constrained Robust Submodular Optimization
In this paper, we consider the problem of constrained maximization of the minimum of a set of submodular functions, in which the goal is to find solutions that are robust to worst-case values of the objective functions. Unfortunately, this problem is both non-submodular and inapproximable. In the case where the submodular functions are monotone, an approximate solution can be found by relaxing ...
متن کاملConstrained Maximization of Non-Monotone Submodular Functions
The problem of constrained submodular maximization has long been studied, with near-optimal results known under a variety of constraints when the submodular function is monotone. The case of nonmonotone submodular maximization is not as well understood: the first approximation algorithms even for unconstrainted maximization were given by Feige et al. [FMV07]. More recently, Lee et al. [LMNS09] ...
متن کاملSubmodular Functions: Optimization and Approximation
Submodular functions are discrete analogue of convex functions, arising in various fields of applied mathematics including game theory, information theory, and queueing theory. This survey aims at providing an overview on fundamental properties of submodular functions and recent algorithmic developments of their optimization and approximation. For submodular function minimization, the ellipsoid...
متن کاملGlobal optimization of robust chance constrained problems
We propose a stochastic algorithm for the global optimization of chance constrained problems. We assume that the probability measure with which the constraints are evaluated is known only through its moments. The algorithm proceeds in two phases. In the first phase the probability distribution is (coarsely) discretized and solved to global optimality using a stochastic algorithm. We only assume...
متن کاملConvex relaxations of chance constrained optimization problems
In this paper we develop convex relaxations of chance constrained optimization problems in order to obtain lower bounds on the optimal value. Unlike existing statistical lower bounding techniques, our approach is designed to provide deterministic lower bounds. We show that a version of the proposed scheme leads to a tractable convex relaxation when the chance constraint function is affine with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2020
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v34i02.5504