On p-norm linear discrimination

Yana Morenko, Alexander Vinel, Zhaohan Yu, Pavlo Krokhmal

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


We consider a p-norm linear discrimination model that generalizes the model of Bennett and Mangasarian (1992) and reduces to a linear programming problem with p-order cone constraints. The proposed approach for handling linear programming problems with p-order cone constraints is based on reformulation of p-order cone optimization problems as second order cone programming (SOCP) problems when p is rational. Since such reformulations typically lead to SOCP problems with large numbers of second order cones, an "economical" representation that minimizes the number of second order cones is proposed. A case study illustrating the developed model on several popular data sets is conducted.

Original languageEnglish (US)
Pages (from-to)784-789
Number of pages6
JournalEuropean Journal of Operational Research
Issue number3
StatePublished - Dec 16 2013


  • Linear separation
  • Second order cone programming
  • p-Order cone programming

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'On p-norm linear discrimination'. Together they form a unique fingerprint.

Cite this