Uses of Package
dev.nm.solver.multivariate.constrained.convex.sdp.pathfollowing
-
Packages that use dev.nm.solver.multivariate.constrained.convex.sdp.pathfollowing Package Description dev.nm.solver.multivariate.constrained.convex.sdp.pathfollowing -
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.pathfollowing used by dev.nm.solver.multivariate.constrained.convex.sdp.pathfollowing Class Description CentralPath A central path is a solution to both the primal and dual problems of a semi-definite programming problem.CSDPMinimizer.Solution HomogeneousPathFollowingMinimizer.Solution This is the solution to a Semi-Definite Programming problem using the Homogeneous Self-Dual Path-Following algorithm.PrimalDualPathFollowingMinimizer The Primal-Dual Path-Following algorithm is an interior point method that solves Semi-Definite Programming problems.PrimalDualPathFollowingMinimizer.Solution This is the solution to a Semi-Definite Programming problem using the Primal-Dual Path-Following algorithm.