Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Covers gradient line search methods and optimization techniques with an emphasis on Wolfe conditions and positive definiteness.
Offers an overview of propositional and predicate logic, sets, functions, relations, algorithms, Swiss cities, sorting tables, Covid infections, poker hands, and prime numbers.
Introduces sets in discrete mathematics and explores proof techniques like direct and indirect proofs.
Covers the Simplex algorithm for function minimization with linear constraints.
Covers the basics of analysis, including proofs, sets, rational and real numbers, and the concept of infimum.
