Uses of Class
dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem.SOCPDualProblem
-
-
Uses of SOCPDualProblem in dev.nm.solver.multivariate.constrained.convex.sdp.socp.interiorpoint
Methods in dev.nm.solver.multivariate.constrained.convex.sdp.socp.interiorpoint with parameters of type SOCPDualProblem Modifier and Type Method Description PrimalDualInteriorPointMinimizer.Solution
PrimalDualInteriorPointMinimizer. solve(SOCPDualProblem problem)
-
Uses of SOCPDualProblem in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem
Subclasses of SOCPDualProblem in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem Modifier and Type Class Description class
SOCPGeneralProblem
Many convex programming problems can be represented in the following form.Constructors in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem with parameters of type SOCPDualProblem Constructor Description SOCPDualProblem(SOCPDualProblem that)
Copy constructor. -
Uses of SOCPDualProblem in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem.portfoliooptimization
Subclasses of SOCPDualProblem in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem.portfoliooptimization Modifier and Type Class Description class
SOCPPortfolioProblem
Constructs an SOCP problem for portfolio optimization.
-