Uses of Class
dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem.SOCPDualProblem1
-
-
Uses of SOCPDualProblem1 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 SOCPDualProblem1 Modifier and Type Method Description PrimalDualInteriorPointMinimizer1.Solution
PrimalDualInteriorPointMinimizer1. solve(SOCPDualProblem1 problem)
-
Uses of SOCPDualProblem1 in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem
Subclasses of SOCPDualProblem1 in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem Modifier and Type Class Description class
SOCPGeneralProblem1
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 SOCPDualProblem1 Constructor Description SOCPDualProblem1(SOCPDualProblem1 that)
Copy constructor. -
Uses of SOCPDualProblem1 in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem.portfoliooptimization
Subclasses of SOCPDualProblem1 in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem.portfoliooptimization Modifier and Type Class Description class
SOCPPortfolioProblem1
Constructs an SOCP problem for portfolio optimization.
-