Sl.No | Chapter Name | MP4 Download |
---|---|---|
1 | Lecture 01: Introduction and History of Optimization | Download |
2 | Lecture 02: Basics of Linear Algebra | Download |
3 | Lecture 03: Definiteness of Matrices | Download |
4 | Lecture 04: Sets in R^n | Download |
5 | Lecture 05: Limit Superior and Limit Inferior | Download |
6 | Lecture 06: Order of Convergence | Download |
7 | Lecture 07: Lipschitz and Uniform Continuity | Download |
8 | Lecture 08 and 09: Partial & Directional Derivatives and Differnentiability | Download |
9 | Lecture 10: Taylor's Theorem | Download |
10 | Lecture 11: Convex Sets & Convexity Preserving Operations | Download |
11 | Lecture 12: Sepration Results | Download |
12 | Lectures 13 & 14: Theorems of Alternatives | Download |
13 | Lecture 15: Convex Functions | Download |
14 | Lecture 16: Properties and Zeroth Order Characterization of Convex Function | Download |
15 | Lecture 17: First-Order and Second-Order Characterization of Convex Functions | Download |
16 | Lecture 18: Convexity Preserving Operations | Download |
17 | Lecture 19: Optimality and Coerciveness | Download |
18 | Lecture 20 Part 1 - First-Order Optimality Conditioin | Download |
19 | Lecture 20 Part 2 - Second-Order Optimality Conditioin | Download |
20 | Lecture 21: General Structure of Unconstrained Optimization Algorithms | Download |
21 | Lecture 22: Inexact Line Search | Download |
22 | Lecture 23 & 24: Globel Convergence of Descent Methods | Download |
23 | Lecture 25: Where Do Descent Methods Converge? | Download |
24 | Lecture 26: Scaling of Variables | Download |
25 | Lectures 27: Practical Stoping Criteria | Download |
26 | Lectures 28 & 29: Steepest Descent Method | Download |
27 | Lectures 30,31&32: Newton's Method | Download |
28 | Lectures 33, 34 & 35 - Quasi Newton Methods | Download |
29 | Lecture 36 & 37 - Conjugate Direction Methods | Download |
30 | Lecture 38 - Trust Region Methods - Part I | Download |
31 | Lecture 38 - Trust Region Methods - Part II | Download |
32 | Lecture 39: A Revisit to Lagrange Multipliears Method | Download |
33 | Lecture 40: Special Cones for Contrained Optimization | Download |
34 | Lecture 41: Tangent Cone | Download |
35 | Lectures 42 & 43: First-Order KKT Optimality Conditions | Download |
36 | Lecture 44: Second-Order KKT Optimality Conditions | Download |
37 | Lecture 45: Constraint Qualifications | Download |
38 | Lectures 46 to 50 : Lagrangian Duality Theory | Download |
39 | Lectures 51, 52 & 53 : Methods for Linearly Constrained Problems | Download |
40 | Lecture 54 : Interior-Point Method for QPP | Download |
41 | Lecture 55 : Penalty Methods | Download |
42 | Lecture 56 : Sequential Quadratic Programming Method | Download |
Sl.No | Chapter Name | English |
---|---|---|
1 | Lecture 01: Introduction and History of Optimization | PDF unavailable |
2 | Lecture 02: Basics of Linear Algebra | PDF unavailable |
3 | Lecture 03: Definiteness of Matrices | PDF unavailable |
4 | Lecture 04: Sets in R^n | PDF unavailable |
5 | Lecture 05: Limit Superior and Limit Inferior | PDF unavailable |
6 | Lecture 06: Order of Convergence | PDF unavailable |
7 | Lecture 07: Lipschitz and Uniform Continuity | PDF unavailable |
8 | Lecture 08 and 09: Partial & Directional Derivatives and Differnentiability | PDF unavailable |
9 | Lecture 10: Taylor's Theorem | PDF unavailable |
10 | Lecture 11: Convex Sets & Convexity Preserving Operations | PDF unavailable |
11 | Lecture 12: Sepration Results | PDF unavailable |
12 | Lectures 13 & 14: Theorems of Alternatives | PDF unavailable |
13 | Lecture 15: Convex Functions | PDF unavailable |
14 | Lecture 16: Properties and Zeroth Order Characterization of Convex Function | PDF unavailable |
15 | Lecture 17: First-Order and Second-Order Characterization of Convex Functions | PDF unavailable |
16 | Lecture 18: Convexity Preserving Operations | PDF unavailable |
17 | Lecture 19: Optimality and Coerciveness | PDF unavailable |
18 | Lecture 20 Part 1 - First-Order Optimality Conditioin | PDF unavailable |
19 | Lecture 20 Part 2 - Second-Order Optimality Conditioin | PDF unavailable |
20 | Lecture 21: General Structure of Unconstrained Optimization Algorithms | PDF unavailable |
21 | Lecture 22: Inexact Line Search | PDF unavailable |
22 | Lecture 23 & 24: Globel Convergence of Descent Methods | PDF unavailable |
23 | Lecture 25: Where Do Descent Methods Converge? | PDF unavailable |
24 | Lecture 26: Scaling of Variables | PDF unavailable |
25 | Lectures 27: Practical Stoping Criteria | PDF unavailable |
26 | Lectures 28 & 29: Steepest Descent Method | PDF unavailable |
27 | Lectures 30,31&32: Newton's Method | PDF unavailable |
28 | Lectures 33, 34 & 35 - Quasi Newton Methods | PDF unavailable |
29 | Lecture 36 & 37 - Conjugate Direction Methods | PDF unavailable |
30 | Lecture 38 - Trust Region Methods - Part I | PDF unavailable |
31 | Lecture 38 - Trust Region Methods - Part II | PDF unavailable |
32 | Lecture 39: A Revisit to Lagrange Multipliears Method | PDF unavailable |
33 | Lecture 40: Special Cones for Contrained Optimization | PDF unavailable |
34 | Lecture 41: Tangent Cone | PDF unavailable |
35 | Lectures 42 & 43: First-Order KKT Optimality Conditions | PDF unavailable |
36 | Lecture 44: Second-Order KKT Optimality Conditions | PDF unavailable |
37 | Lecture 45: Constraint Qualifications | PDF unavailable |
38 | Lectures 46 to 50 : Lagrangian Duality Theory | PDF unavailable |
39 | Lectures 51, 52 & 53 : Methods for Linearly Constrained Problems | PDF unavailable |
40 | Lecture 54 : Interior-Point Method for QPP | PDF unavailable |
41 | Lecture 55 : Penalty Methods | PDF unavailable |
42 | Lecture 56 : Sequential Quadratic Programming Method | PDF unavailable |
Sl.No | Language | Book link |
---|---|---|
1 | English | Not Available |
2 | Bengali | Not Available |
3 | Gujarati | Not Available |
4 | Hindi | Not Available |
5 | Kannada | Not Available |
6 | Malayalam | Not Available |
7 | Marathi | Not Available |
8 | Tamil | Not Available |
9 | Telugu | Not Available |