Finding the hyperplane that best separates two clusters of points is an important problem in many areas, and particularly in training Support Vector Machines (SVMs). The desirable solution is shown to satisfy an NLP problem with a single nonlinear constraint. Existing methodology transforms this problem to a dual convex QP problem, but is shown to be unreliable in many situations.
A new proposal based on the SQP method is described, along with numerical experience. Potential applications can have a very large number of points in the clusters and are computationally challanging. We outline an approximation scheme based on low-rank Cholesky factors.
Current 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
