Full Length Paper

Mathematical Programming Computation

, Volume 2, Issue 3, pp 167-201

Open Access This content is freely available online to anyone, anywhere at any time.

Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones

  • Martin S. AndersenAffiliated withElectrical Engineering Department, University of California Email author 
  • , Joachim DahlAffiliated withMOSEK ApS
  • , Lieven VandenbergheAffiliated withElectrical Engineering Department, University of California

Abstract

We describe an implementation of nonsymmetric interior-point methods for linear cone programs defined by two types of matrix cones: the cone of positive semidefinite matrices with a given chordal sparsity pattern and its dual cone, the cone of chordal sparse matrices that have a positive semidefinite completion. The implementation takes advantage of fast recursive algorithms for evaluating the function values and derivatives of the logarithmic barrier functions for these cones. We present experimental results of two implementations, one of which is based on an augmented system approach, and a comparison with publicly available interior-point solvers for semidefinite programming.

Mathematics Subject Classification (2000)

90-08 Mathematical Programming - computational methods 90C06 Mathematical Programming - large-scale 90C22 Mathematical Programming - semidefinite programing 90C25 Mathematical Programming - convex programming 90C51 Mathematical Programming - interior-point methods