Chance-constrained sets approximation: a probabilistic scaling approach
From MaRDI portal
(Redirected from Publication:2071956)
Abstract: In this paper, a sample-based procedure for obtaining simple and computable approximations of chance-constrained sets is proposed. The procedure allows to control the complexity of the approximating set, by defining families of simple-approximating sets of given complexity. A probabilistic scaling procedure then allows to rescale these sets to obtain the desired probabilistic guarantees. The proposed approach is shown to be applicable in several problem in systems and control, such as the design of Stochastic Model Predictive Control schemes or the solution of probabilistic set membership estimation problems.
Recommendations
- Approximations for chance-constrained programming problems
- On safe tractable approximations of chance constraints
- Constraint-admissible sets for systems with soft constraints and their application in model predictive control
- Partial sample average approximation method for chance constrained problems
- An inner-outer approximation approach to chance constrained optimization
Cites work
- scientific article; zbMATH DE number 995813 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1795892 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3373547 (Why is no real title available?)
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A Stochastic Programming Model
- A branch and bound method for stochastic integer problems under probabilistic constraints
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
- Bounded Error Identification of Systems With Time-Varying Parameters
- Chance Constrained Programming with Joint Constraints
- Concavity and efficient points of discrete distributions in probabilistic programming.
- Constraint-Tightening and Stability in Stochastic Model Predictive Control
- Convex Approximations of Chance Constrained Programs
- Convexity of chance constraints with independent random variables
- Determinants and the volumes of parallelotopes and zonotopes
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- Dual methods for probabilistic optimization problems.
- Eventual convexity of chance constrained feasible sets
- Eventual convexity of probability constraints with elliptical distributions
- Fault diagnosis and fault tolerant control using set-membership approaches: application to real case studies
- From CVaR to uncertainty set: implications in joint chance-constrained optimization
- Guaranteed state estimation by zonotopes
- Lectures on stochastic programming. Modeling and theory.
- On distributionally robust chance-constrained linear programs
- On safe tractable approximations of chance constraints
- On the Road Between Robust Optimization and the Scenario Approach for Chance Constrained Optimization Problems
- Pattern-based modeling and solution of probabilistically constrained optimization problems
- Probabilistic constraints via SQP solver: application to a renewable energy management problem
- Probabilistically Robust AC Optimal Power Flow
- Random convex programs
- Randomized Strategies for Probabilistic Solutions of Uncertain Feasibility and Optimization Problems
- Randomized methods for design of uncertain systems: sample complexity and sequential algorithms
- Relaxations and approximations of chance constraints under finite distributions
- Research on probabilistic methods for control system design
- Robust convex optimization
- Robust design through probabilistic maximization
- Semidefinite programming for chance constrained optimization over semialgebraic sets
- Sequential approximation of feasible parameter sets for identification with set membership uncertainty
- Simple approximations of semialgebraic sets and their applications to control
- Solving chance-constrained optimization problems with stochastic quadratic inequalities
- Stochastic MPC with offline uncertainty sampling
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- The Scenario Approach to Robust Control Design
- The problem of calculating the volume of a polyhedron is enumerably hard
Cited in
(1)
This page was built for publication: Chance-constrained sets approximation: a probabilistic scaling approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2071956)
