NOC:Nonlinear Programming


Lecture 1 - Convex Sets and Functions


Lecture 2 - Properties of Convex Functions - I


Lecture 3 - Properties of Convex Functions - II


Lecture 4 - Properties of Convex Functions- III


Lecture 5 - Convex Programming Problems


Lecture 6 - KKT optimality conditions


Lecture 7 - Quadratic Programming Problems - I


Lecture 8 - Quadratic Programming Problems - II


Lecture 9 - Separable Programming - I


Lecture 10 - Separable Programming - II


Lecture 11 - Geometric Programming - I


Lecture 12 - Geometric Programming - II


Lecture 13 - Geometric Programming - III


Lecture 14 - Dynamic Programming - I


Lecture 15 - Dynamic Programming - II


Lecture 16 - Dynamic programming approach to find shortest path in any network


Lecture 17 - Dynamic Programming - IV


Lecture 18 - Search Techniques - I


Lecture 19 - Search Techniques - II


Lecture 20 - Search Techniques - III