Robust chance-constrained optimization with discrete distributions
From MaRDI portal
Cites work
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- A gradient-based method for joint chance-constrained optimization with continuous distributions
- A joint model of probabilistic/robust constraints for gas transport management in stationary networks
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A smooth approximation approach for optimization with probabilistic constraints based on sigmoid function
- A smoothing function approach to joint chance-constrained programs
- A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- An inner-outer approximation approach to chance constrained optimization
- Bundle method for non-convex minimization with inexact subgradients and function values
- Chance Constrained Programming with Joint Constraints
- Chance-constrained programs with convex underlying functions: a bilevel convex optimization perspective
- Concavity and efficient points of discrete distributions in probabilistic programming.
- Convergence analysis on a smoothing approach to joint chance constrained programs
- Cutting plane oracles to minimize non-smooth non-convex functions
- Data-driven chance constrained stochastic program
- Data-driven distributionally robust chance-constrained optimization with Wasserstein metric
- Decomposable robust two-stage optimization: an application to gas network operations under uncertainty
- Distributionally robust chance constrained problem under interval distribution information
- Distributionally robust chance constraints for non-linear uncertainties
- Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity
- Distributionally robust joint chance constraints with second-order moment information
- Distributionally robust optimization. A review on theory and applications
- Evaluating Gas Network Capacities
- Exact penalty functions in nonlinear programming
- Frameworks and results in distributionally robust optimization
- Global optimization of robust chance constrained problems
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Introduction to stochastic programming.
- Joint model of probabilistic-robust (probust) constraints applied to gas network optimization
- Lectures on stochastic programming. Modeling and theory
- Multistage stochastic optimization
- On convex probabilistic programming with discrete distributions.
- On distributionally robust chance constrained programs with Wasserstein distance
- On distributionally robust chance-constrained linear programs
- On safe tractable approximations of chance constraints
- On the quantification of nomination feasibility in stationary gas networks with random load
- Optimal Convergence Rates for the Proximal Bundle Method
- Outer approximation for mixed-integer nonlinear robust optimization
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Quick Simultaneous Confidence Intervals for Multinomial Proportions
- Rate of convergence of the bundle method
- Relaxations and approximations of chance constraints under finite distributions
- Robust optimization
- Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints
- Sample average approximation method for chance constrained programming: Theory and applications
- Sequential convex approximations to joint chance constrained programs: A Monte Carlo approach
- Solving chance-constrained problems via a smooth sample-based nonlinear approximation
- Technical Note—Data-Driven Chance Constrained Programs over Wasserstein Balls
- Uncertain convex programs: randomized solutions and confidence levels
- Variational Analysis
This page was built for publication: Robust chance-constrained optimization with discrete distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7300535)