Uses of Class
dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem.SOCPLinearInequality
-
Packages that use SOCPLinearInequality Package Description dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem -
-
Uses of SOCPLinearInequality in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem
Methods in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem that return SOCPLinearInequality Modifier and Type Method Description SOCPLinearInequality
SOCPLinearInequalities. get(int index)
Methods in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem that return types with arguments of type SOCPLinearInequality Modifier and Type Method Description Iterator<SOCPLinearInequality>
SOCPLinearInequalities. iterator()
Methods in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem with parameters of type SOCPLinearInequality Modifier and Type Method Description void
SOCPLinearInequalities. add(SOCPLinearInequality inequality)
Constructors in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem with parameters of type SOCPLinearInequality Constructor Description SOCPGeneralProblem1(Vector f, SOCPGeneralConstraint[] generalConstraints, SOCPLinearInequality[] linearInequalities, SOCPLinearEquality[] linearEqualities)
Construct a general Second Order Conic Programming problem.\[ \begin{align*} \min_x \quad &; \mathbf{f^T} x \\ \textrm{s.t.} \quad &; \lVert {A_i}^T x + c_i \rVert_2 \leq b_i^T x + d_i,\quad i = 1,\dots,m \end{align*} \]
-