Name | Description | Type | Package | Framework |
CentralPath | A central path is a solution to both the primal and dual problems of a semi-definite programming problem. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.pathfollowing | SuanShu |
CSDPMinimizer | See Also:"Borchers, Brian, "CSDP, a C Library for Semidefinite Programming", Optimization Methods and Software 11(1): 613-623, 1999. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.pathfollowing | SuanShu |
HomogeneousPathFollowingMinimizer | This implementation solves a Semi-Definite Programming problem using the Homogeneous Self-Dual Path-Following algorithm. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.pathfollowing | SuanShu |
Hp | This is the symmetrization operator as defined in equation (6) in the reference. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.pathfollowing | SuanShu |
PrimalDualPathFollowingMinimizer | The Primal-Dual Path-Following algorithm is an interior point method that solves Semi-Definite Programming problems. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.pathfollowing | SuanShu |