Here are some suggestions for projects to do. Either pick something from this list or use it as inspiration.
If you choose a project use strikthrought to remove it -> crossed
Optimization methods not covered in the theory. Provide a working implementation and demonstrate it in the notebook.
- Conjugate gradient descent
- Cross-entropy method
- Firefly algorithm
Bee Colony Optimization- Cuckoo search
- maximum flow problems
- Levenberg–Marquardt algorithm (for nonlinear regression and inverse kinematics)
- ...
Solve a problem using a method from the course or a new one.
- time table scheduling
- analytic solution of a ODE using genetic programming
solve a Sudoku using local search- graph matching using simulated annealing
- finding negative cycles using the Bellman–Ford algorithm
- multiple sequence alignment using Genetic Algorithms
- using MaxEnt to find the best probability distribution
- ray tracing with Dijkstra
- homebrew SVM
- recovering images from a few pixels using compressed sensing (L1-norm minimization)
- visalizing complex networks using quadratic optimization
- ...
Experiment and learn. Show me something exciting about optimization.
- fitting a neural network by optimizing one weigth at a time
- search paths of Hill Climbing: an exhaustive search
- non-covergence as a regularization mechanism in machine learning
- improving gradient descent or learning using gradient startvation
- ...