Short list of covered topics
This course focuses on algorithms for solving convex optimization problems and the implications for statistical estimation.
Topics include: convex sets and functions, canonical problems, first order numeric optimization, duality and KKT conditions, glimpse of 0th/2nd order methods, coordinate descent and ADMM, path algorithms and regularized statistical models
