1. Projection on a simplex (with Python implementation)
2. Speed comparison between quadratic programming solvers of Gurobi and cvxpy using SVM as baseline
3. Python implementation of robust SVM (with ramp loss) using the ConCave-Convex Procedure

Latex test: