Covers the fundamentals of convex optimization, including mathematical problems, minimizers, and solution concepts, with an emphasis on efficient methods and practical applications.
Covers the basics of optimization, including historical perspectives, mathematical formulations, and practical applications in decision-making problems.
Discusses optimization techniques in machine learning, focusing on stochastic gradient descent and its applications in constrained and non-convex problems.
Explores Ant Colony Optimization (ACO) for routing and optimization, discussing constructive heuristics, local search, pheromone mechanisms, and real-world applications.
Explores coordinate descent optimization strategies, emphasizing simplicity in optimization through one-coordinate updates and discussing the implications of different approaches.
