In this paper we consider the general cone programming problem, and propose primal-dual convex (smooth and/or nonsmooth) minimization reformulations for it. We then discuss first-order methods suitable for solving these reformulations, namely, Nesterov’s optimal method (Nesterov in Doklady AN SSSR 269:543–547, 1983; Math Program 103:127–152, 2005), Nesterov’s smooth approximation scheme (Nesterov in Math Program 103:127–152, 2005), and Nemirovski’s prox-method (Nemirovski in SIAM J Opt 15:229–251, 2005), and propose a variant of Nesterov’s optimal method which has outperformed the latter one in our computational experiments. We also derive iteration-complexity bounds for these first-order methods applied to the proposed primal-dual reformulations of the cone programming problem. The performance of these methods is then compared using a set of randomly generated linear programming and semidefinite programming instances. We also compare the approach based on the variant of Nesterov’s optimal method with the low-rank method proposed by Burer and Monteiro (Math Program Ser B 95:329–357, 2003; Math Program 103:427–444, 2005) for solving a set of randomly generated SDP instances.
Hiriart-Urruty, J.-B., Lemaréchal, C.: Convex analysis and minimization algorithms I. Comprehensive Study in Mathematics, vol. 305. Springer, New York (1993)Google Scholar
Hoda, S., Gilpin, A., Peña, J.: A gradient-based approach for computing nash equilibria of large sequential games. Working Paper, Tepper School of Business, Carnegie Mellon University (2006)Google Scholar
Korpelevich G.: The extragradient method for finding saddle points and other problems. Eknomika i Matematicheskie Metody 12, 747–756 (1976)MATHGoogle Scholar
Lu Z., Nemirovski A., Monteiro R.D.C.: Large-scale semidefinite programming via saddle point mirror-prox algorithm. Math. Program. 109, 211–237 (2007)MATHCrossRefMathSciNetGoogle Scholar
Nemirovski A.: Prox-method with rate of convergence O(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Opt. 15, 229–251 (2005)CrossRefMathSciNetGoogle Scholar
Nesterov Y.E.: A method for unconstrained convex minimization problem with the rate of convergence O(1/k2). Doklady AN SSSR 269, 543–547 (1983) (translated as Sov. Math. Docl.)MathSciNetGoogle Scholar