An 𝒪(m/ε^3.5)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints release_wl4jzbxrrjhk7onzfefrcmpwxu

by Yin Tat Lee, Swati Padmanabhan

Released as a article .

2021  

Abstract

We study semidefinite programs with diagonal constraints. This problem class appears in combinatorial optimization and has a wide range of engineering applications such as in circuit design, channel assignment in wireless networks, phase recovery, covariance matrix estimation, and low-order controller design. In this paper, we give an algorithm to solve this problem to ε-accuracy, with a run time of 𝒪(m/ε^3.5), where m is the number of non-zero entries in the cost matrix. We improve upon the previous best run time of 𝒪(m/ε^4.5) by Arora and Kale. As a corollary of our result, given an instance of the Max-Cut problem with n vertices and m ≫ n edges, our algorithm when applied to the standard SDP relaxation of Max-Cut returns a (1 - ε)α_GW cut in time 𝒪(m/ε^3.5), where α_GW≈ 0.878567 is the Goemans-Williamson approximation ratio. We obtain this run time via the stochastic variance reduction framework applied to the Arora-Kale algorithm, by constructing a constant-accuracy estimator to maintain the primal iterates.
In text/plain format

Archived Files and Locations

application/pdf  841.0 kB
file_yagmple2sfbf7bhbjdfnp4cimu
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2021-12-06
Version   v2
Language   en ?
arXiv  1903.01859v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 322b629a-69c1-4199-9e52-ea44289ccef5
API URL: JSON