The optimization package
These are a set of implementations of various numerical optimization methods in Haskell. Note that these implementations were originally written as part of a class project; while at one point they worked no attention has been given to numerical stability or the many other potential difficulties of implementing robust numerical methods. That being said, they should serve to succinctly illustrate a number of optimization techniques from the modern optimization literature.
A deep introduction to optimization can be found in Boyd and Vandenberghe's *Convex Optimization* which available freely online, (http://web.stanford.edu/~boyd/cvxbook/).
[Skip to ReadMe]
|Versions||0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.1.5, 0.1.6, 0.1.7|
|Dependencies||ad (>=3.4 && <4.3), base (>=4.4 && <5), distributive (>=0.3 && <0.5), linear (>=1.16 && <2.0), semigroupoids (>=3.0 && <6.0), vector (>=0.10 && <1.0) [details]|
|Copyright||Copyright (C) 2013 Ben Gamari|
|Maintainer||Ben Gamari <firstname.lastname@example.org>|
|Source repository||head: git clone git://github.com/bgamari/optimization.git|
|Uploaded||Thu Nov 26 10:18:04 UTC 2015 by BenGamari|
|Downloads||1177 total (9 in last 30 days)|
|Status||Docs uploaded by user|
Build status unknown [no reports yet]
- optimization-0.1.7.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
For package maintainers and hackage trustees