Skip to content
Minimization algorithms on pure Ruby
Ruby
Latest commit a006c85 Aug 15, 2014 @clbustos Version on separate file
Failed to load latest commit information.
lib Version on separate file Aug 15, 2014
spec
.gitignore
Gemfile
Gemfile.lock
History.txt
LICENSE.txt
Manifest.txt
README.md
Rakefile
minimization.gemspec

README.md

= minimization

== DESCRIPTION:

Minimization algorithms on pure Ruby.

== FEATURES/PROBLEMS:

Unidimensional:

  • Newton-Rahpson (requires first and second derivative)
  • Golden Section
  • Brent (Port of GSL code)

Multidimensional:

  • Fletcher-Reeves (requires first derivative)
  • Polak Rebirer (requires first derivative)
  • Nelder-Mead
  • Powell's method

If you needs speed, use rb-gsl

== SYNOPSIS:

d=Minimization::Brent.new(-1000,20000 , proc {|x| x**2})

d.iterate

puts d.x_minimum puts d.f_minimum

== REQUIREMENTS:

  • Pure Ruby

== INSTALL:

sudo gem install minimization

== API:

http://ruby-statsample.rubyforge.org/minimization/

== LICENSE:

BSD 2-clause (See LICENSE.txt)

Something went wrong with that request. Please try again.