Solution of the generalized Neyman-Pearson problem using methods of optimal partitioning of sets

MaRDI QIDQ3363004zbMATH OpenFDO

Authors E. M. Kiseleva

Publication date 1992

zbMATH Keywords

Neyman-Pearson problem

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Mathematical programming (90C99)

Recommendations

• Generalized Neyman-Pearson lemma via convex duality.
• A fuzzy decision problem based on the generalized Neyman-Pearson criterion
• A new proof of the Neyman‐Pearson lemma from the solution of a maximin receiver problem
• scientific article; zbMATH DE number 4066136
• An extended nonrandomized procedure in the generalized Neyman-Pearson method

Cited in

(2)

• Solution of the generalized Neyman-Pearson problem using the methods for the optimal partitioning of sets
• An extended nonrandomized procedure in the generalized Neyman-Pearson method

This page was built for publication: Solution of the generalized Neyman-Pearson problem using methods of optimal partitioning of sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3363004)