IIT Bombay · Engineering

Optimization from fundamentals

Prof. Ankur A. Kulkarni · 67 free video lectures

67 video lectures. Topics: Introduction; Isoperimetric problem; Review of real analysis (sequences and convergence); Bolzano-Weierstrass theorem and completeness axiom; Open sets, closed sets and compact sets; Continuity and Weierstrass theorem; Weierstrass theorem; Different solution concepts…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Lecture 1A : Introduction
  2. Lecture 1B : Isoperimetric problem
  3. Lecture 1C : Review of real analysis (sequences and convergence)
  4. Lecture 2A : Bolzano-Weierstrass theorem and completeness axiom
  5. Lecture 2B : Open sets, closed sets and compact sets
  6. Lecture 2C : Continuity and Weierstrass theorem
  7. Lecture 3A : Weierstrass theorem
  8. Lecture 3B : Different solution concepts
  9. Lecture 3C : Different types of constraints
  10. Lecture 4A : Taylor's theorem
  11. Lecture 4B: First order sufficient condition
  12. Lecture 4C : Second order necessary condition
  13. Lecture 5A : Least square regression
  14. Lecture 5B : Least square regression (continued)
  15. Lecture 5C : Implicit function theorem
  16. Lecture 6A : Optimization with equality constraints and introduction to Lagrange multipliers - I
  17. Lecture 6B :Optimization with equality constraints and introduction to Lagrange multipliers - II
  18. Lecture 6C :Least norm solution of underdetermined linear system
  19. Lecture 7A: Transformation of optimization problems - I
  20. Lecture 7B : Transformation of optimization problems - II
  21. Lecture 7C: Transformation of optimization problems - III
  22. Lecture 8A: Convex Analysis - I
  23. Lecture 8B: Convex Analysis - II
  24. Lecture 8C: Convex Analysis - III
  25. Lecture 9A: Polyhedrons
  26. Lecture 9B: Minkowski-Weyl Theorem
  27. Lecture 9C: Linear Programming Problems
  28. Lecture 10A: Extreme points and optimal solution of an LP
  29. Lecture 10B: Extreme points and optimal solution of an LP (continued)
  30. Lecture 10C: Extreme points and basic feasible solutions
  31. Lecture 11A: Equivalence of extreme point and BFS
  32. Lecture 11B: Equivalence of extreme point and BFS (continued)
  33. Lecture 11C: Examples of Linear Programming
  34. Lecture 12A: Weak and Strong duality
  35. Lecture 12B: Proof of strong duality
  36. Lecture 12C: Proof of strong duality (continued)
  37. Lecture 13A: Farkas' lemma
  38. Lecture 13B: Max-flow Min-cut problem
  39. Lecture 13C: Shortest path problem
  40. Lecture 14A: Complementary Slackness
  41. Lecture 14B: Proof of complementary slackness
  42. Lecture 14C: Tangent cones
  43. Lecture 15A:Tangent cones (continued)
  44. Lecture 15B: Constraint qualifications, Farkas' lemma and KKT
  45. Lecture 16A: KKT conditions
  46. Lecture 16B:Convex optimization and KKT conditions
  47. Lecture 17A: Slater condition and Lagrangian Dual
  48. Lecture 17B: Weak duality in convex optimization and Fenchel dual
  49. Lecture 17C: Geometry of the Lagrangian
  50. Lecture 18A: Strong duality in convex optimization - I
  51. Lecture 18B: Strong duality in convex optimization - II
  52. Lecture 18C: Strong duality in convex optimization - III
  53. Lecture 19A: Line search methods for unconstrained optimization
  54. Lecture 19B: Wolfe conditions
  55. Lecture 19C: Line search algorithm and convergence
  56. Lecture 20A: Steepest descent method and rate of convergence
  57. Lecture 20B: Newton's method
  58. Lecture 20C: Penalty methods
  59. Lecture 21A: L1 and L2 Penalty methods
  60. Lecture 21B: Augmented Lagrangian methods
  61. Lecture 21C: Cutting plane methods
  62. Lecture 22: Interior point methods for linear programming
  63. Lecture 23A: Dynamic programming: Inventory control problem
  64. Lecture 23B: Policy and value function
  65. Lecture 24A: Principle of optimality in dynamic programming
  66. Lecture 24B: Principle of optimality applied to inventory control problem
  67. Lecture 24C: Optimal control for a system with linear state dynamics and quadratic cost

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Bombay.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights