v0.3.0

Primarily migrating from publishing to bintray (which went EOL) to oss.sonatype.org. The other main change is that the commons math dependency is now explicit instead of % Provided because "Provided" was breaking the packageDoc build for some reason.

v0.2.2

Fix for #8 (infinite looping that appeared intermittently)

v0.2.1

• Fix #5 (intermittent infinite looping)
• Fix #4 (make SVD KKT solver the default)

v0.2.0

• fixes issue #1 in feasible point solving
• a couple other internal improvements to feasible point solving

v0.1.1

• Fixed a subtle bug in halting conditions due to floating point epsilon considerations
• Updated backtracking alpha and beta defaults to be more optimized on larger matrix solving

Pilot release v0.1.0

Implementation of the Barrier Method from §11.3 of Convex Optimization, Boyd and Vandenberghe, Cambridge University Press, 2008

Provides two optimizers:

• BarrierOptimizer - minimize convex functions under convex inequality constraints and/or linear equality constraints
• NewtonOptimizer - minimize convex functions under linear equality constraints

Also provides ConvexOptimizer.feasiblePoint(...) for solving a feasible initial guess.