Approximation AlgorithmsCovers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Quasi-newton optimizationCovers gradient line search methods and optimization techniques with an emphasis on Wolfe conditions and positive definiteness.
Cutting Plane MethodsExplores cutting plane methods, ellipsoid algorithm, and competitive algorithms for optimization.
KKT and Convex OptimizationCovers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.
Proof of Strong DualityCovers the proof of strong duality in optimization problems and provides examples of Rayleigh quotient optimization.
Optimization methodsCovers optimization methods, focusing on gradient methods and line search techniques.
