hi guys,
solving the primal with SGD is NOT ok. SGD in the primal won't even be possible in the case of infinite dimensional hilbert spaces. sgd using the dual problem tends not to give terribly good quality solutions unless you know what you're doing.
as for programming, you can choose ANY programming language you want (but you must be able to code in at least one of them).
matlab - quadprog
python - cvxopt cvxmod
c/c++ - ooqp, loqo (free for academic use)
afaict even excel has a quadratic programming solver. many years ago when i checked, it was faulty but i (hope/believe) that it's been fixed in the meantime.
so, you have the constraint \sum_i \alpha_i y_i = 0 and moreover 0 \leq \alpha_i \leq C
the latter constraint is simply 1 * \alpha \leq C and -1 * \alpha \leq 0 (the identity is also a matrix). as for the equality constraint, either pick a different interface or think about how you could express it as two inequalities.
cheers,
alex
--
''~``
( o o )
+----------------------.oooO--(_)--Oooo.---------------------------+
| Gates Hillman Center 8002 Carnegie Mellon University |
| Pittsburgh 15213 PA ( ) Oooo. Machine Learning Department |
+-------------------------\ (----( )-----------------------------+
\_) ) /
(_/