Registry / utility / joptimizer

joptimizer

JSON →
library3.3.0javamavenunverified

JOptimizer is a java library for solving general convex optimization problems, like for example LP, QP, QCQP, SOCP, SDP, GP and many more.

<dependency> <groupId>com.github.vincentfk</groupId> <artifactId>joptimizer</artifactId> <version>3.3.0</version> </dependency>
INSTALL
IMPORT
SIG · JOPTIMIZER
J
joptimizer
utilityjavav3.3.0
harness data pending
Install & Compatibility
Where this runs

No compatibility data collected yet for this library.

Code
Verified usage

Verified import paths — ran on the pinned version, not inferred.

LPPrimalDualMethod
com.joptimizer.optimizers.LPPrimalDualMethod

Minimal example solving a linear programming problem with JOptimizer.

import com.joptimizer.optimizers.LPPrimalDualMethod; import com.joptimizer.functions.ConvexMultivariateRealFunction; import com.joptimizer.functions.LinearMultivariateRealFunction; import com.joptimizer.functions.PDQuadraticMultivariateRealFunction; import org.apache.commons.math3.linear.Array2DRowRealMatrix; public class Quickstart { public static void main(String[] args) throws Exception { // Example: minimize x + y subject to x >= 0, y >= 0 LinearMultivariateRealFunction objective = new LinearMultivariateRealFunction(new double[]{1, 1}, 0); ConvexMultivariateRealFunction[] constraints = new ConvexMultivariateRealFunction[]{ new LinearMultivariateRealFunction(new double[]{-1, 0}, 0), // -x <= 0 new LinearMultivariateRealFunction(new double[]{0, -1}, 0) // -y <= 0 }; LPPrimalDualMethod optimizer = new LPPrimalDualMethod(objective, constraints, null, null, null, null); optimizer.optimize(); double[] solution = optimizer.getOptimizer(); System.out.println("Solution: x=" + solution[0] + ", y=" + solution[1]); } }
Debug
Known issues

No known issues recorded.

Upgrade
Version history
3.3.0latest on Maven
Audit
Dependencies

No dependency data recorded yet.

Agent activity
6 hits · last 30 days
node
6
Resources
joptimizer — mvn dependency:get joptimizer · libregistry