| Interface | Description |
|---|---|
| MinMaxMinimizer<T> |
A minmax minimizer minimizes a minmax problem.
|
| MinMaxProblem<T> |
A minmax problem is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss while maximizing the potential gain.
|
| Class | Description |
|---|---|
| LeastPth<T> |
The least p-th minmax algorithm minimizes the maximal error/loss (function):
\[
\min_x \max_{\omega \in S} e(x, \omega)
\]
\(e(x, \omega)\) is the error or loss function.
|