Uses of Interface
dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.QPMinimizer
-
Packages that use QPMinimizer Package Description dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.activeset dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.socp -
-
Uses of QPMinimizer in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.activeset
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.activeset that implement QPMinimizer Modifier and Type Class Description class
QPDualActiveSetMinimizer
This implementation solves a Quadratic Programming problem using the dual active set algorithm.class
QPPrimalActiveSetMinimizer
This implementation solves a Quadratic Programming problem using the Primal Active Set algorithm. -
Uses of QPMinimizer in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.socp
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.socp that implement QPMinimizer Modifier and Type Class Description class
QPbySOCPMinimizer
We first convert a QP problem to an equivalent SOCP problem and then solve it using an SOCP solver.class
QPbySOCPMinimizer1
A QP problem is first converted into an equivalent SOCP problemSOCPGeneralProblem1
and then solve it using an SOCP solverPrimalDualInteriorPointMinimizer1
.
-