Professional Documents
Culture Documents
CACSE50, ED Optimization 3 1 0 4 25 25 50 - -
Technique for
machine learning
COURSE OUTCOMES
UNIT-1
Introduction to Optimization: Engineering application of Optimization, Statement of an
Optimization problem, Optimal Problem formulation, Classification of Optimization problem.
Optimum design concepts: Definition of Global and Local optima, Optimality criteria, Review of basic
calculus concepts, Global optimality.
UNIT-2
Convex optimization: convex sets, convexity-preserving operations, examples of convex programs
(linear programming (LP), second-order cone programming (SOCP), semidefinite programming
(SDP), convex relaxation, KKT conditions, duality.
UNIT-3
UNIT-4
Stochastic and nonconvex optimization: Dual averaging, Polyak–Juditsky averaging, stochastic
variance reduced gradient (SVRG), Langevin dynamics, escaping saddle points, landscape of
nonconvex problems.
UNIT-5
SUGGESTED READINGS
• Stephen Boyd and Lieven Vandenberghe’s book: Convex Optimization
• Nesterov’s new book: Lectures on Convex Optimization
• Introduction to Nonlinear Optimization - Theory, Algorithms and Applications by
Amir Beck
• K. Deb, ‘Optimization for Engineering Design Algorithms and Examples’, PHI, 2000
• Kulkarni, A. J., & Satapathy, S. C. (Eds.). (2020). Optimization in machine learning
and applications (pp. 51-68). Heidelberg: Springer.
• Sra, S., Nowozin, S., & Wright, S. J. (Eds.). (2012). Optimization for machine
learning. Mit Press.
• Jain, P., & Kar, P. (2017). Non-convex optimization for machine learning.
Foundations and Trends® in Machine Learning, 10(3-4), 142-363.