The recent approach of solving large scale semidefinite programs with a first order method by minimizing an augmented primal-dual function is extended to doubly nonnegative programs. Regularity of the augmented primal-dual function is established under the condition of uniqueness and strict complementarity. The application to the doubly nonnegative cone is motivated by the fact that the cost per iteration does not increase by adding nonnegativity constraints. Numerical experiments indicate that this extension is a particularly rewarding application.
The final publication is available at http://link.springer.com DOI: 10.1007/s10107-013-0687-3