Feasible and Accurate Algorithms for Covering Semidefinite Programs

In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs that arise in the context of developing algorithms for important optimization problems such as Undirected Sparsest Cut, wireless multicasting, and pattern classification. We give algorithms for covering SDPs whose dependence on e is e−1. These algorithms, therefore, have a better dependence on e than other combinatorial approaches, with a tradeoff of a somewhat worse dependence on the other parameters. For many reasons, including numerical stability and a variety of implementation concerns, the dependence on e is critical, and the algorithms in this paper may be preferable to those of the previous work. Our algorithms exploit the structural similarity between packing and covering semidefinite programs and packing and covering linear programs.

[1]  Michael I. Jordan,et al.  A Direct Formulation for Sparse Pca Using Semidefinite Programming , 2004, SIAM Rev..

[2]  Sanjeev Arora,et al.  Fast algorithms for approximate semidefinite programming using the multiplicative weights update method , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[3]  Daniel Bienstock,et al.  Solving fractional packing problems in Oast(1/ε) iterations , 2004, STOC '04.

[4]  Lisa Fleischer,et al.  A fast approximation scheme for fractional covering problems with variable upper bounds , 2004, SODA '04.

[5]  Clifford Stein,et al.  Implementation of a Combinatorial Multicommodity Flow Algorithm , 1991, Network Flows And Matching.

[6]  L. Lovász,et al.  Polynomial Algorithms for Perfect Graphs , 1984 .

[7]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[8]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[9]  Nikos D. Sidiropoulos,et al.  Transmit beamforming for physical-layer multicasting , 2006, IEEE Transactions on Signal Processing.

[10]  Philip N. Klein,et al.  On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms , 1999, SIAM J. Comput..

[11]  David R. Karger,et al.  Approximate graph coloring by semidefinite programming , 1998, JACM.

[12]  Kilian Q. Weinberger,et al.  Distance Metric Learning for Large Margin Nearest Neighbor Classification , 2005, NIPS.

[13]  Sanjeev Arora,et al.  A combinatorial, primal-dual approach to semidefinite programs , 2007, STOC '07.

[14]  Fred S. Roberts,et al.  DIMACS Series in Discrete Mathematics and Theoretical Computer Science , 2001 .

[15]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[16]  Andrew V. Goldberg,et al.  An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow , 1998, IPCO.

[17]  Renato D. C. Monteiro,et al.  Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression , 2009, Mathematical Programming.

[18]  Clifford Stein,et al.  Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring , 2005, IPCO.

[19]  Yurii Nesterov,et al.  Smoothing Technique and its Applications in Semidefinite Optimization , 2004, Math. Program..

[20]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[21]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[22]  Hsueh-I Lu,et al.  Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING , 1996, STOC '96.

[23]  Yurii Nesterov,et al.  Smooth minimization of non-smooth functions , 2005, Math. Program..

[24]  Daniel Bienstock,et al.  Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice , 2002 .

[25]  Hsueh-I Lu,et al.  Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs , 1998, ISAAC.

[26]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).