Optimization Problems

This lesson is focused on combinatorial optimization problems. The optimization techniques presented here include so-called "gradient free" methods, which are suitable for problems where the objective function is not differentiable.

Tabu Search: text

Local Beam Search: text

Simulated Annealing: text

Genetic Algorithms: text

Late Acceptance Hill Climbing: text

Basin hopping: text

Gradient-Free Optimization Algorithms

• Tabu Search
• Differential Evolution
• Evolutionary Strategies
• Particle Swarm Optimization

Gradient-Based Optimization Algorithms

• Gradient Descent
• Quasi-Newtonian Methods
• Levenburg-Marquardt