| Package | Description |
|---|---|
| dev.nm.solver.multivariate.constrained.convex.sdp.pathfollowing |
| Class and 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.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.