#This repository provides an implementation of the Nelder-Mead optimization algorithm in Python. The Nelder-Mead algorithm is a simplex-based optimization method for finding the minimum or maximum of an objective function. It works by iteratively updating the vertices of a simplex (a set of d+1 points in d-dimensional space) to converge to the optimal solution.
-
Notifications
You must be signed in to change notification settings - Fork 0
License
raj-thapa/Nelder-Mead
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published