Interview Questions
Search
Legacy
Tests
Repository
DashBoard
Java
Java 8
Java 7
Java Abbreviations
OCJP / SCJP
Class List
New in Java 8
Java Exceptions
Spring Exceptions
Java Enums
Java 8 Lambda
Java 8 java.time
Big Data
Discussion Forum
Humor
Classes Search
Subscribe
Search Java Classes and Packages
Search Java Frameworks and Libraries
Search
255581 classes and counting ...
Search Tips
Index Status
Default search is case insesitive, and looks for keyword within name
For exact search, prefix = to the keyword ( Example =hashmap )
For search within frameworks / Libraries, use framework name or framework type name within round parenthesis, Example
map(spring) - Will give all map classes within Spring Frameworks / Libraries
=map(java) - Will give map classes ( exact match ) within standard java libraries
map(bigdata) - Will give map classes within all bigdata frameworks / Libraries
map(web) - Will give map classes within all java web frameworks / Libraries
#Com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.problem Classes and Interfaces - 14 results found.
Name
Description
Type
Package
Framework
PortfolioRiskExactSigma .DefaultRoot
Computes the matrix root by Cholesky and on failure by MatrixRootByDiagonalization.
Class
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.problem.portfoliooptimization
SuanShu
PortfolioRiskExactSigma .Diagonalization
Computes the matrix root by MatrixRootByDiagonalization.
Class
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.problem.portfoliooptimization
SuanShu
PortfolioRiskExactSigma .MatrixRoot
Specifies the method to compute the root of a matrix.
Interface
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.problem.portfoliooptimization
SuanShu
SOCPDualProblem
This is the Dual Second Order Conic Programming problem.
Class
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.problem
SuanShu
SOCPDualProblem .EqualityConstraints
Class
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.problem
SuanShu
SOCPGeneralConstraint
This represents the SOCP general constraint of this form.
Class
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.problem
SuanShu
SOCPGeneralConstraints
This represents a set of SOCP general constraints of this form.
Class
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.problem
SuanShu
SOCPGeneralProblem
Many convex programming problems can be represented in the following form.
Class
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.problem
SuanShu
SOCPPortfolioConstraint
An SOCP constraint for portfolio optimization, e.
Class
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.problem.portfoliooptimization
SuanShu
SOCPPortfolioConstraint .ConstraintViolationException
Exception thrown when a constraint is violated.
Class
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.problem.portfoliooptimization
SuanShu
SOCPPortfolioConstraint .Variable
Class
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.problem.portfoliooptimization
SuanShu
SOCPPortfolioObjectiveFunction
Constructs the objective function for portfolio optimization.
Class
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.problem.portfoliooptimization
SuanShu
SOCPPortfolioProblem
Constructs an SOCP problem for portfolio optimization.
Class
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.problem.portfoliooptimization
SuanShu
SOCPRiskConstraint
Class
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.problem.portfoliooptimization
SuanShu
