Lectures related to Optimization Algorithms

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Covers functions, differentiability, Taylor expansions, and integrals, providing fundamental concepts and practical applications.

Covers the limited development of integration and methods for calculating the limit development of functions and antiderivatives.

Covers the study of convergence of sequences, integrals, and functions.

Explores extreme points in linear programming and the role of constraints in finding optimal solutions.

Explores algorithmic complexity, comparing growth rates using Theta notation and characterizing different complexity classes.