| Class | Description |
|---|---|
| CentralPath |
A central path is a solution to both the primal and dual problems of a semi-definite programming problem.
|
| CSDPMinimizer |
Implements the CSDP algorithm for semidefinite programming problem with equality constraints.
|
| HomogeneousPathFollowingMinimizer |
This implementation solves a Semi-Definite Programming problem using the Homogeneous Self-Dual
Path-Following algorithm.
|
| Hp |
This is the symmetrization operator as defined in equation (6) in the reference.
\[
H_p: C^{n \times n} \rightarrow \textit{H}^n \\
H_p(U) = \frac{1}{2}[PUP^{-1}]+P^{-*}U^*P^*
\]
|
| PrimalDualPathFollowingMinimizer |
The Primal-Dual Path-Following algorithm is an interior point method that solves Semi-Definite
Programming problems.
|
Copyright © 2010-2026 NM Group. All Rights Reserved.