Skip to content

petrposik/step

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

Python Implementation of the STEP Optimization Algorithm

STEP ("Select the Easiest Point") is a scalar optimization algorithm that minimizes a function by halving intervals over the bounded space iteratively, each time selecting the interval with smallest "difficulty". The difficulty measure is curvature of x^2 function crossing the interval boundary points and touching the supposed (so-far-estimated) optimum; this curvature will be small for intervals that have boundary points near the optimum. The "smoother" the function, the better this works.

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=349896 http://www.applied-mathematics.net/optimization/Step.pdf

For now, see the top of the step.py module for usage instructions and some simple examples.

About

Python Implementation of the STEP Scalar Optimization Algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Python 100.0%