An interesting link between linear feasibility, linear programming, support vector margin and convex hull.
Résumé
This short paper presents an algorithm based on simple projections and linear feasibility queries which solves both linear programming, and, support vector margin. In addition, this algorithm is strongly polynomial on special instance of both linear program and support vector margin, characterized by a similar convex hull property. Thus, this algorithm could be interesting as a link between all these four notions: linear feasibility, linear programming, support vector margin and convex hull.
Domaines
Recherche opérationnelle [math.OC]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...