You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The Jaya algorithm is a metaheuristic which is capable of solving both constrained and unconstrained optimization problems. It is a population-based method which repeatedly modifies a population of individual solutions. It is a gradient-free optimization algorithm. It does not contain any hyperparameters.
TLBO is a powerful and versatile optimization algorithm that can be used to solve a wide variety of problems. It is a good choice for problems where simplicity and ease of implementation are important.
FinDi: Finite Difference Gradient Descent can optimize any function, including the ones without analytic form, by employing finite difference numerical differentiation within a gradient descent algorithm
An ant farm manager! ♻️ In this repo I'll help my little friends find the most optimized path(s) to get form point A to point B by designing and implementing my own pathfinding algorithm 🐜
Computational Mathematics (CM) for learning and data analysis Project - Training a neural network with nonlinear conjugate gradient (FR, PR, HS, PR+, HS+) and limited-memory bfgs methods.