On cone optimization approaches for semi-supervised support vector machines(S<sup>3</sup>VM)

Faizan Ahmed, Muhammad Faisal Iqbal, Ayesha Rafiq

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review


In this paper, a review of cone programming formulation of soft margin semi-supervised support vector machines is provided. The S 3 VM is known to be NP-hard, thus their cone programming reformulation remains NP-hard. However, the reformulation converts the problem into a convex optimization problem. The formulations can be classified into semidefinite programming reformulation and copositive reformulation. We have collected several semi-definite and copositive programming reformulations. The relations between these reformulations are also discussed.
Original languageEnglish
Title of host publication2019 2nd International Conference on Computing, Mathematics and Engineering Technologies, iCoMET 2019
Number of pages6
ISBN (Electronic)978-1-5386-9509-8
Publication statusPublished - 2019
Externally publishedYes


Dive into the research topics of 'On cone optimization approaches for semi-supervised support vector machines(S<sup>3</sup>VM)'. Together they form a unique fingerprint.

Cite this