Simple LP solver based on http://en.wikipedia.org/wiki/Karmarkar's_algorithm Note that this is not Karmarkar's algorithm.
Algorithms for finding a bipartite matching.
Solve argmin (a dot x + .5 * x dot (B * x) + .5 * normSquaredPenalty * (x dot x)) for x subject to norm(x) <= maxNormValue
Solve argmin (a dot x + .5 * x dot (B * x) + .5 * normSquaredPenalty * (x dot x)) for x subject to norm(x) <= maxNormValue
Based on the code from "Trust Region Newton Method for Large-Scale Logistic Regression" * @author dlwh
DSL for LinearPrograms.
DSL for LinearPrograms. Not thread-safe per instance. Make multiple instances
Basic example:
val lp = new LP import lp._ val x = new Positive("x") val y = new Positive("y") val result = maximize ( (3 * x+ 4 * y) subjectTo( x <= 3, y <= 1)) result.valueOf(x) // 3
NNLS solves nonnegative least squares problems using a modified projected gradient method.
Power Method to compute maximum eigen value and companion object to compute minimum eigen value through inverse power iterations
mixed 0-1 ILP Solver based on Branch and bound
mixed 0-1 ILP Solver based on Branch and bound
http://www.ee.ucla.edu/ee236a/lectures/intlp.pdf
InteriorPoint solver for LPs.
Algorithm to find a minimum cost matching on a bipartite graph.
Algorithm to find a minimum cost matching on a bipartite graph.
Implements the hungarian algorithm.
Algorithms for finding a bipartite matching. We include one optimal algorithm (KuhnMunkres) and one greedy algorithm (competitive linking).
Algorithms find minimum matchings.