Abstract

We investigate the augmented Lagrangian penalty function approach to solve semidefinite programs. It turns out that this method generates iterates which lie on the boundary of the cone of semidefinite matrices which are driven to the affine subspace described by the linear equations defining the semidefinite program. We provide some computational experience with this method and show in particular, that it allows to compute the theta number of a graph to reasonably high accuracy for instances which are beyond reach by other methods.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call