Search Java Classes and Packages

Search Java Frameworks and Libraries

255581 classes and counting ...
Search Tips Index Status



#Com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.pathfollowing Classes and Interfaces - 5 results found.
NameDescriptionTypePackageFramework
CentralPathA central path is a solution to both the primal and dual problems of a semi-definite programming problem.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.pathfollowingSuanShu
CSDPMinimizerSee Also:"Borchers, Brian, "CSDP, a C Library for Semidefinite Programming", Optimization Methods and Software 11(1): 613-623, 1999.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.pathfollowingSuanShu
HomogeneousPathFollowingMinimizerThis implementation solves a Semi-Definite Programming problem using the Homogeneous Self-Dual Path-Following algorithm.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.pathfollowingSuanShu
HpThis is the symmetrization operator as defined in equation (6) in the reference.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.pathfollowingSuanShu
PrimalDualPathFollowingMinimizerThe Primal-Dual Path-Following algorithm is an interior point method that solves Semi-Definite Programming problems.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.pathfollowingSuanShu