A central path is a solution to both the primal and dual problems of a semi-definite programming problem.
Implements the CSDP algorithm for semidefinite programming problem with equality constraints.
This implementation solves a Semi-Definite Programming problem using the Homogeneous Self-Dual Path-Following algorithm.
This is the symmetrization operator as defined in equation (6) in the reference.
The Primal-Dual Path-Following algorithm is an interior point method that solves Semi-Definite Programming problems.
Copyright © 2010-2018 Numerical Method Incorporation Limited. All Rights Reserved.