Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints
Discarding constraints in scenario optimization, a technique known as the sampling-and-discarding scheme, allows the decision maker to trade feasibility to performance. Recently, a removal scheme with a less conservative bound on the constraint violation probability of the final decision has been pr...
Հիմնական հեղինակներ: | Romao, L, Margellos, KN, Papachristodoulou, A |
---|---|
Ձևաչափ: | Journal article |
Լեզու: | English |
Հրապարակվել է: |
Elsevier
2023
|
Նմանատիպ նյութեր
-
On the exact feasibility of convex scenario programs with discarded constraints
: Romao, L, և այլն
Հրապարակվել է: (2022) -
Tight sampling and discarding bounds for scenario programs with an arbitrary number of removed samples
: Romao, L, և այլն
Հրապարակվել է: (2021) -
Tight generalization guarantees for the sampling and discarding approach to scenario optimization
: Romao, L, և այլն
Հրապարակվել է: (2021) -
Probabilistic feasibility guarantees for solution sets to uncertain variational inequalities
: Fabiani, F, և այլն
Հրապարակվել է: (2022) -
A posteriori probabilistic feasibility guarantees for Nash equilibria in uncertain multi-agent games
: Pantazis, G, և այլն
Հրապարակվել է: (2021)