Multiple C/C++ optimization algorithms (derivative and non-derivative) for finding the local minimum of a cost function. Algorithms: Grid-Search, Pattern-Search, Golden-Ratio, Gradient Descent, Newton, Quasi-Newton, Cauchy/Steepest Descent.
This project aims to take the shortest route to all selected cities and return to the starting city. It uses the dijikstra algorithm while calculating the shortest path.
Non Linear Mathematical Optimization for objective functions f: ℝn→ ℝ.
Add a description, image, and links to the find-minimum topic page so that developers can more easily learn about it.
To associate your repository with the find-minimum topic, visit your repo's landing page and select "manage topics."