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.
Those seeking a high-level overview of some of these methods are referred to Stephen Wright's excellent tutorial from NIPS 2010 http://videolectures.net/nips2010_wright_oaml/. A deeper introduction can be found in Boyd and Vandenberghe's *Complex Optimization* which available freely online.
[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.0), base (>=4.4 && <5), distributive (==0.3.*), linear (>=1.0 && <2.0), semigroupoids (>=3.0 && <4.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||Tue Oct 15 13:21:29 UTC 2013 by BenGamari|
|Downloads||2404 total (558 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs available [build log]
Successful builds reported [all 1 reports]
Hackage Matrix CI
For package maintainers and hackage trustees