numerical experiments – Page 3 – Optimization Online

Preprocessing sparse semidefinite programs via matrix completion

Published: 2004/03/16, Updated: 2004/07/02

Semi-definite Programming clique tree, matrix completion, numerical experiments, preprocessing, semidefinite programming, sparsity

Considering that preprocessing is an important phase in linear programming, it should be systematically more incorporated in semidefinite programming solvers. The conversion method proposed by the authors (SIAM Journal on Optimization, vol.~11, pp.~647–674, 2000, and Mathematical Programming, Series B, vol.~95, pp.~303–327, 2003) is a preprocessing of sparse semidefinite programs based on matrix completion. This article … Read more

PHoM – a Polyhedral Homotopy Continuation Method for Polynomial Systems

Published: 2003/01/15

Nonlinear Systems and Least-Squares homotopy continuation methods, numerical experiments, polyhedral homotopy, polynomials, software package

PHoM is a software package in C++ for finding all isolated solutions of polynomial systems using a polyhedral homotopy continuation method. Among three modules constituting the package, the first module StartSystem constructs a family of polyhedral-linear homotopy functions, based on the polyhedral homotopy theory, from input data for a given system of polynomial equations $\f(\x) … Read more