Positive Semidefinite Programming: Mixed, Parallel, and Width-Independent

02/12/2020
by   Arun Jambulapati, et al.
0

We give the first approximation algorithm for mixed packing and covering semidefinite programs (SDPs) with polylogarithmic dependence on width. Mixed packing and covering SDPs constitute a fundamental algorithmic primitive with recent applications in combinatorial optimization, robust learning, and quantum complexity. The current approximate solvers for positive semidefinite programming can handle only pure packing instances, and technical hurdles prevent their generalization to a wider class of positive instances. For a given multiplicative accuracy of ϵ, our algorithm takes O(log^3(ndρ) ·ϵ^-3) parallelizable iterations, where n, d are dimensions of the problem and ρ is a width parameter of the instance, generalizing or improving all previous parallel algorithms in the positive linear and semidefinite programming literature. When specialized to pure packing SDPs, our algorithm's iteration complexity is O(log^2 (nd) ·ϵ^-2), a slight improvement and derandomization of the state-of-the-art (Allen-Zhu et. al. '16, Peng et. al. '16, Wang et. al. '15). For a wide variety of structured instances commonly found in applications, the iterations of our algorithm run in nearly-linear time. In doing so, we give matrix analytic techniques for overcoming obstacles that have stymied prior approaches to this open problem, as stated in past works (Peng et. al. '16, Mahoney et. al. '16). Crucial to our analysis are a simplification of existing algorithms for mixed positive linear programs, achieved by removing an asymmetry caused by modifying covering constraints, and a suite of matrix inequalities whose proofs are based on analyzing the Schur complements of matrices in a higher dimension. We hope that both our algorithm and techniques open the door to improved solvers for positive semidefinite programming, as well as its applications.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/25/2018

Finding Sparse Solutions for Packing and Covering Semidefinite Programs

Packing and covering semidefinite programs (SDPs) appear in natural rela...
research
06/03/2019

A Direct Õ(1/ε) Iteration Parallel Algorithm for Optimal Transport

Optimal transportation, or computing the Wasserstein or “earth mover's” ...
research
09/26/2019

Faster width-dependent algorithm for mixed packing and covering LPs

In this paper, we give a faster width-dependent algorithm for mixed pack...
research
04/29/2018

A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints

Motivated by applications in machine learning, such as subset selection ...
research
06/12/2020

Robust Sub-Gaussian Principal Component Analysis and Width-Independent Schatten Packing

We develop two methods for the following fundamental statistical task: g...
research
11/23/2018

On polyhedral approximations of the positive semidefinite cone

Let D be the set of n× n positive semidefinite matrices of trace equal t...
research
08/14/2019

A Survey of Recent Scalability Improvements for Semidefinite Programming with Applications in Machine Learning, Control, and Robotics

Historically, scalability has been a major challenge to the successful a...

Please sign up or login with your details

Forgot password? Click here to reset