Iterated local search

Formal sciences
Mathematics
Mathematical optimization
Metaheuristics

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (9)

Constraint Satisfaction: Formulation and Algorithms

Covers the formulation of constraint satisfaction problems and systematic algorithms for solving them efficiently.

Optimization Techniques: Local Search, VNS, Simulated Annealing

Explores optimization techniques like local search, VNS, and simulated annealing.

Ant Colony Optimization: Routing and Optimization

Explores Ant Colony Optimization (ACO) for routing and optimization, discussing constructive heuristics, local search, pheromone mechanisms, and real-world applications.

Lipschitz Gradient Theorem

Covers the Lipschitz gradient theorem and its applications in function optimization.

Riemannian gradient descent

Explores Riemannian gradient descent, covering Taylor expansions, optimality conditions, algorithm templates, line search, and critical points.

Optimization and Simulation: Heuristics and Neighborhoods

Explores greedy heuristics, neighborhoods in optimization, and local search algorithms.

Nonlinear Optimization: Newton's Method

Explores nonlinear optimization, focusing on Newton's method and descent methods for finding optimal solutions efficiently.

Convex Sets: MGT-418 Lecture

On Convex Optimization covers course organization, mathematical optimization problems, solution concepts, and optimization methods.

Optimization Methods in Machine Learning

Explores optimization methods in machine learning, emphasizing gradients, costs, and computational efforts for efficient model training.

Page 1 of 1