Quadratic and convex minimax classification problems

Tomonari Kitahara, Shinji Mizuno, Kazuhide Nakata

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


When there are two classes whose mean vectors and covariance matrices are 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 LMC, we prove that solutions of these problems can be obtained by solving LMC.

Original languageEnglish
Pages (from-to)191-201
Number of pages11
JournalJournal of the Operations Research Society of Japan
Issue number2
Publication statusPublished - Jun 2008
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Decision Sciences(all)
  • Management Science and Operations Research


Dive into the research topics of 'Quadratic and convex minimax classification problems'. Together they form a unique fingerprint.

Cite this