Skip to content

Implementation of methods for unconstrained search for the minima of the univariate and multivariate functions

Notifications You must be signed in to change notification settings

lovelyscientist/func-optimization-methods

Repository files navigation

Function optimization methods using Python 3

The code consists of the following search methods for finding minima of the univariate functions:

  • Bisection method (also known as dichotomy method)
  • Golden sections search
  • Fibonacci search

The code consists of the following gradient descent methods for finding minima of the multivariate functions:

  • Newton
  • Fast descent (also known as Steepest descent)
  • Descent with step-size decreasing

Dependencies:

  • numpy
  • matplotlib
  • mpl_toolkits

To run the program, execute: python3 main.py

Snapshots of plots generated by the program:

Contour plot of the gradient methods:

Contour

3D-plot of the gradient methods:

3D-plot

About

Implementation of methods for unconstrained search for the minima of the univariate and multivariate functions

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages