How to reduce your reliance on "bad" open source packages ✨ RSVP

optimization
Release 0.1.9

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 /Convex Optimization/ which available freely online, http://web.stanford.edu/~boyd/cvxbook/. Vandenberghe's lecture at the 2009 Machine Learning Summer School may also be of interest http://videolectures.net/mlss09uk_vandenberghe_co/.

Homepage Repository Hackage Haskell Download

Keywords: library, math, Propose Tags, http://videolectures.net/nips2010_wright_oaml/, http://web.stanford.edu/~boyd/cvxbook/, http://videolectures.net/mlss09uk_vandenberghe_co/, Skip to Readme, , Index, Optimization.Constrained.Penalty, Optimization.Constrained.ProjectedSubgradient, Optimization.LineSearch, Optimization.LineSearch.BFGS, Optimization.LineSearch.BarzilaiBorwein, Optimization.LineSearch.ConjugateGradient, Optimization.LineSearch.MirrorDescent, Optimization.LineSearch.SteepestDescent, Optimization.TrustRegion.Fista, Optimization.TrustRegion.Nesterov1983, Optimization.TrustRegion.Newton, optimization-0.1.9.tar.gz, browse, Package description, Package maintainers, BenGamari, edit package information , 0.1.9, tutorial
License: BSD-3-Clause
Install: cabal install optimization-0.1.9

Documentation

optimization

Those seeking a high-level overview of some of these methods are referred to Stephen Wright's excellent tutorial from NIPS 2010. A deeper introduction can be found in Boyd and Vandenberghe's Complex Optimization which available freely online.