Skip to content

This is an implementation of 9 different optimization-algorithms (single variable). The algorithms are created to find the minima for given convex function.

Notifications You must be signed in to change notification settings

MRK4863/optimization_techniques-single_variable

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 

Repository files navigation

Optimization_Techniques(single_variable)

Binder

.. image:: https://mybinder.org/badge_logo.svg :target: https://mybinder.org/v2/gh/MRK4863/optimization_techniques-single_variable.git/HEAD?urlpath=https%3A%2F%2Fgithub.com%2FMRK4863%2Foptimization_techniques-single_variable%2Fblob%2Fmaster%2Fmath_algorithms.ipynb

This is an implementation of 9 different optimization-algorithms (single variable). The algorithms are created to find the minima for given convex function. The following are the 9 algorithms implemented

  1. Exhaustive search algorithm
  2. Bounding Phase algorithm
  3. Interval Halving algorithm
  4. Fibonacci Search method
  5. Golden Search method
  6. Succesive Quadratic Estimation
  7. Bisection Method
  8. Newton Raphson Method

Feel free to try out the code here: https://mybinder.org/v2/gh/MRK4863/optimization_techniques-single_variable.git/HEAD?urlpath=https%3A%2F%2Fgithub.com%2FMRK4863%2Foptimization_techniques-single_variable%2Fblob%2Fmaster%2Fmath_algorithms.ipynb ;)

About

This is an implementation of 9 different optimization-algorithms (single variable). The algorithms are created to find the minima for given convex function.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published