Skip to content

Latest commit

 

History

History
9 lines (7 loc) · 338 Bytes

README.md

File metadata and controls

9 lines (7 loc) · 338 Bytes

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.