Polyhedral Separation via Difference of Convex (DC) Programming

  • Annabella Astorino
  • Massimo Di Francesco
  • Manlio Gaudioso
  • Enrico Gorgone
  • Benedetto Manca
    • Categories Nonsmooth Optimization Short URL: https://optimization-online.org/?p=16855

    We consider polyhedral separation of sets as a possible tool in supervised classification. In particular we focus on the optimization model introduced by Astorino and Gaudioso and adopt its reformulation in Difference of Convex (DC) form. We tackle the problem by adapting the algorithm for DC programming known as DCA. We present the results of the implementation of DCA on a number of benchmark classification datasets.

    Article

    Download

    View Polyhedral Separation via Difference of Convex (DC) Programming