Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints (Q2683215)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints |
scientific article |
Statements
Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints (English)
0 references
3 February 2023
0 references
randomized algorithms
0 references
sampling-and-discarding
0 references
scenario approach theory
0 references
uncertain optimization problems
0 references
0 references
0 references
0 references
0 references
0 references
