Skip to content

lenassero/linear-svm

Repository files navigation

Convex Optimization

Optimization of a linear SVM primal and dual problems using various optimization methods:

  • Barrier method with backtracking line search
  • Barrier method with Damped Newton
  • Coordinate descent method

References

Boyd, S. and Vandenberghe, L. (2009). Convex optimization. New York: Cambridge University Press.

About

Linear SVM optimization from scratch.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published