Robust budget allocation via continuous submodular functions
From MaRDI portal
Publication:2019911
DOI10.1007/s00245-019-09567-0zbMath1465.90057arXiv1702.08791OpenAlexW3160894936MaRDI QIDQ2019911
Stefanie Jegelka, Matthew Staib
Publication date: 22 April 2021
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.08791
nonconvex optimizationrobust optimizationbudget allocationsubmodular optimizationconstrained submodular optimization
Nonconvex programming, global optimization (90C26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Robustness in mathematical programming (90C17)
Related Items
Frameworks and results in distributionally robust optimization ⋮ A bi-criteria algorithm for online non-monotone maximization problems: DR-submodular+concave ⋮ Online non-monotone DR-submodular maximization: 1/4 approximation ratio and sublinear regret
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Active set algorithms for isotonic regression; a unifying framework
- Polymatroids and mean-risk minimization in discrete optimization
- A tutorial on geometric programming
- New algorithms for convex cost tension problem with application to computer vision
- Conditional gradient algorithms with open loop step size rules
- Discrete convex analysis
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- Templates for convex cone problems with applications to sparse signal recovery
- Exact bounds for steepest descent algorithms of $L$-convex function minimization
- Risk averse submodular utility maximization
- Submodular functions: from discrete to continuous domains
- Constrained maximization of posynomials by geometric programming
- Submodular functions and optimization.
- Rings of sets
- Submodular Function Maximization on the Bounded Integer Lattice
- Relative Entropy Relaxations for Signomial Optimization
- Supermodular programming on finite lattices
- Theory and Applications of Robust Optimization
- Robust Monotone Submodular Function Maximization
- Submodular Stochastic Probing on Matroids
- Submodular Approximation: Sampling-based Algorithms and Lower Bounds
- Stochastic Covering and Adaptivity
- Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
- Geometric Programming: Methods, Computations and Applications
- Finding the nearest point in A polytope
- Minimizing a Submodular Function on a Lattice
- Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack
- The limitations of optimization from samples
- Subquadratic submodular function minimization
- Submodular Function Minimization under Covering Constraints
- Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
- Maximizing Social Influence in Nearly Optimal Time
- Geometric Programming for Communication Systems
