In this paper, we study primal-dual first-order methods for a class of cone programming problems. In particular, we first present four natural primal-dual smooth convex minimization reformulations for them and then discuss a first-order method, that is, a variant of Nesterov's smooth (VNS) method [A. Auslender and M. Teboulle, Interior gradient and proximal methods for convex and conic optimization, SIAM J. Optim. 16(3) (2006), pp. 697-725], for solving these reformulations. The associated worst-case major arithmetic operation costs of the VNS method are estimated and compared. We conclude that the VNS method based on the last reformulation generally outperforms the others. Finally, we justify our theoretical prediction on the behaviour of the VNS method by conducting numerical experiments on Dantzig selector, basis pursuit de-noising, MAXCUT SDP relaxation and Lovász capacity problems.
Bibliographical noteFunding Information:
The author thank two anonymous referees for the insightful comments and suggestions, which have greatly improved the paper. The author was supported in part by NSERC Discovery Grant.
- cone programming
- first-order methods
- variant of Nesterov's smooth method