Artificial Intelligence & Data Science is coming soon

We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.

Artificial Intelligence & Data Science

Optimization Algorithms

Formulation, LP and duality, simplex and KKT, genetic algorithms, simulated annealing and PSO, differential evolution, firefly and bat algorithms.

Interview questions
Notes for Optimization Algorithms are being written and reviewed. Until they're up, Aria teaches every topic — ask for any part of the syllabus, with worked numericals.

Coming next in Optimization Algorithms

  1. Formulating optimisation problems· notes coming
  2. Classification of optimisation algorithms· notes coming
  3. Travelling salesman and knapsack problems· notes coming
  4. Optimality conditions· notes coming
  5. Linear programming and duality· notes coming
  6. Integer linear programming· notes coming
  7. Convex and quadratic programming· notes coming
  8. Simplex and revised simplex methods· notes coming
  9. Karush-Kuhn-Tucker conditions· notes coming
  10. Dynamic programming· notes coming
  11. Genetic algorithms· notes coming
  12. Simulated annealing· notes coming
  13. Particle swarm optimisation· notes coming
  14. Differential evolution· notes coming
  15. Multi-objective optimisation and Pareto fronts· notes coming
  16. Ant colony optimisation· notes coming
  17. Self-tuning algorithms· notes coming
  18. Firefly algorithm· notes coming
  19. Bat algorithm· notes coming
  20. Linear algebra for optimisation· notes coming
  21. Quadratic forms and matrix norms· notes coming
  22. Golden-section and Fibonacci search· notes coming
  23. Newton's and secant methods· notes coming
  24. Equality and inequality constrained problems· notes coming
  25. Projected gradient methods· notes coming
  26. Penalty methods· notes coming
  27. Bayesian optimisation· notes coming