Generalized Neyman-Pearson lemma via convex duality. (Q5933652)
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: Generalized Neyman-Pearson lemma via convex duality. |
scientific article; zbMATH DE number 1599642
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized Neyman-Pearson lemma via convex duality. |
scientific article; zbMATH DE number 1599642 |
Statements
Generalized Neyman-Pearson lemma via convex duality. (English)
0 references
2001
0 references
hypothesis testing
0 references
Komlós theorem
0 references
non-smooth convex analysis
0 references
normal cones
0 references
optimal generalized tests
0 references
saddle-points
0 references
stochastic games
0 references
subdifferentials
0 references
0 references
0.8323039412498474
0 references
0.8247156739234924
0 references
0.7978692650794983
0 references
0.7790666818618774
0 references
