| Package | Description |
|---|---|
| dev.nm.solver.multivariate.constrained.convex.sdp.socp.interiorpoint |
| Class and Description |
|---|
| PrimalDualInteriorPointMinimizer.Solution
This is the solution to a Dual Second Order Conic Programming problem using the Primal Dual
Interior Point algorithm.
|
| PrimalDualSolution
The vector set {x, s, y} is a solution to both the primal and dual SOCP problems.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.