Course11110416542 lectures
A Primer to Mathematical Optimization
Prof. Debdas Ghosh · IIT(BHU) Varanasi
About
In this era of Machine Learning and Data Science, students often crave for learning the basic tools of optimization theory because machine learning ideas essentially exploit the power of Numerical Linear Algebra, Optimization, and Statistics. The primary aim of this course is to hand over a complete readymade package for beginners in mathematical optimization. 'Complete' in the sense of its mathematical orientation, geometrical explanation, problem-solution sheets, and tutorial sheets. After attending this course, students will get to know the standard methods, and basic and modern results in optimization. The concepts will be explained not only with mathematical rigor but also with geometrical essence so that students feel optimization is fun. The course covers mathematical foundation for optimization and basic techniques of unconstrained and constrained optimization problems.
Intended audience: Third Year Undergraduates of Mathematics / Computer Science / Electrical / Mechanical Engineering
Prerequisites: Calculus, Linear Algebra, Coordinate Geometry
Lectures
Week 01
- Lecture 01: Introduction and Histroy on the Development of Optimization Theory
- Lecture 02: Tools from Linear Algebra
- Lecture 03: Tools from Linear Algebra
Week 02
- Lecture 04 : Tools for calculus of several variables
- Lecture 05 : Tools from calculus of several variables
Week 03
Week 04
Week 05
- Lecture - 10 : Taylor's Theorem
- Lecture - 11 : Convex Sets & Convexity Preserving Operations
- Lecture - 12 : Separation Result
Week 06
- Lecture - 13 & 14 : Theorems of Alternatives
- Lecture - 15 : Convex Functions
- Lecture -16 : Properties and Zeroth Order Characterization of Convex Functions
- Lecture - 17 : First-Order and Second-Order Characterization of Convex Functions
- Lecture - 18 : Convexity Preserving Operations
- Lecture - 19 : Optimality and Coerciveness
Week 07
- Lecture 20 part 1: First Order Optimality Condition
- Lecture 20 part 2: Second Order Optimality Conditions
- Lecture 21: General Structure of Unconstrained Optimization Algorithms
- Lecture 22: Inexact Line Search
- Lecture 23 & 24: Global Convergence of Descent Methods
- Lecture 25: Where do Descent Methods Converge?
Week 08
- Lecture - 26 : Scaling Of Variables
- Lecture - 27 : Practical Stopping Criteria
- Lecture - 28 & 29 : Steepest Descent Method
- Lecture - 30, 31 & 32 : Newton's Method
Week 09
Week 10
- Lecture - 39 : A Revisit to Lagrange Multipliears Method
- Lecture - 40 : Special Cones for Contrained Optimization
- Lecture - 41 : Tangent Cone
- Lecture - 42 & 43 : First-Order KKT Optimality Conditions
- Lecture 44 : Second-Order KKT Optimality Conditions
- Lecture 45 : Constraint Qualifications
Week 11
- Lecture 46, 47, 48, 49 & 50 : Lagrangian Duality Theory
- Lecture 51, 52 & 53 : Methods for Linearly Constrained Problems
Week 12
Syllabus and materials
At NPTEL, as the course publishes them.
Credits and licence
- Institution
- IIT(BHU) Varanasi
- Department
- Mathematics
- Teacher
- Prof. Debdas Ghosh
- Level
- Undergraduate
- Language
- English
- Subjects
- Mathematics
- Source
- NPTEL
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only. NPTEL's terms
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge. Coordinated by IIT Kanpur.
- Who can watch
- NPTEL gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed
More like this
Course
The Analytics Edge
35 lectures · Video
Course
Single Variable Calculus
35 lectures · Video
Course
Multivariable Calculus
35 lectures · Video