Quadratic and Convex Minimax Classification problems

When there are two classes whose mean vectors and covariance matrices axe known, Lanckriet et al. [7] consider the Linear Minimax Classification (LMC) problem and they propose a method for solving it. In this paper we first discuss the Quadratic Minimax Classification (QMC) problem, which is a generalization of LMC. We show that QMC is transformed to a parametric Semidefinite Programming (SDP) problem. We further define the Convex Minimax Classification (CMC) problem. Though the two problems are generalizations of UMC, we prove that solutions of these problems can be obtained by solving LMC.