com.github.thssmonkey:LBFGS 1.0.1

Limited-memory BFGS (L-BFGS) is an optimization algorithm in the family of quasi-Newton methods that approximates the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm using a limited amount of computer memory. It is a popular algorithm for parameter estimation in machine learning. The algorithm's target problem is to minimize f(x) over unconstrained values of the real-vector x where f is a differentiable scalar function.

Categories	KeY Data Data Formats Formal Verification
GroupId	com.github.thssmonkey
ArtifactId	LBFGS
Version	1.0.1
Type	jar

Download LBFGS 1.0.1

Filename	Size
LBFGS-1.0.1.pom
LBFGS-1.0.1.jar	2 KB

Apache Maven

<!-- https://jarcasting.com/artifacts/com.github.thssmonkey/LBFGS/ -->
<dependency>
    <groupId>com.github.thssmonkey</groupId>
    <artifactId>LBFGS</artifactId>
    <version>1.0.1</version>
</dependency>

Gradle Groovy

// https://jarcasting.com/artifacts/com.github.thssmonkey/LBFGS/
implementation 'com.github.thssmonkey:LBFGS:1.0.1'

Gradle Kotlin

// https://jarcasting.com/artifacts/com.github.thssmonkey/LBFGS/
implementation ("com.github.thssmonkey:LBFGS:1.0.1")

Apache Buildr

'com.github.thssmonkey:LBFGS:jar:1.0.1'

Apache Ivy

<dependency org="com.github.thssmonkey" name="LBFGS" rev="1.0.1">
  <artifact name="LBFGS" type="jar" />
</dependency>

Groovy Grape

@Grapes(
@Grab(group='com.github.thssmonkey', module='LBFGS', version='1.0.1')
)

Scala SBT

libraryDependencies += "com.github.thssmonkey" % "LBFGS" % "1.0.1"

Leiningen

[com.github.thssmonkey/LBFGS "1.0.1"]