1 research outputs found
Solving Semidefinite Programs using Preconditioned Conjugate Gradients
The contribution of this paper is to describe a general technique to solve some classes of large but sparse semidefinite problems via a robust primal-dual interior-point technique which uses an inexact Gauss-Newton approach with a matrix free preconditioned conjugate gradient method. This approach avoids the ill-conditioning pitfalls that result from symmetrization and from forming the so-called normal equations, while maintaining the primal-dual framework