Approximation AlgorithmsCovers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Coin Change ProblemExplores the coin change problem, comparing greedy and dynamic programming algorithms for optimal solutions.
Multi-arm BanditsDiscusses algorithms for balancing exploration and exploitation in decision-making processes.
Quasi-newton optimizationCovers gradient line search methods and optimization techniques with an emphasis on Wolfe conditions and positive definiteness.
Controlled Stochastic ProcessesExplores controlled stochastic processes, focusing on analysis, behavior, and optimization, using dynamic programming to solve real-world problems.
