Corpus ID: 67877060

# An $\widetilde\mathcalO(m/\varepsilon^3.5)$-Cost Algorithm for Semidefinite Programs with Diagonal Constraints

@inproceedings{Lee2020AnA,
title={An \$\widetilde\mathcalO(m/\varepsilon^3.5)\$-Cost Algorithm for Semidefinite Programs with Diagonal Constraints},
booktitle={COLT},
year={2020}
}
• Published in COLT 2020
• Mathematics, Computer Science
• 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 $\varepsilon$-accuracy, with a run time of $\widetilde{\mathcal{O}}(m/\varepsilon^{3.5})$, where $m$ is the number of non-zero… CONTINUE READING
2 Citations

#### Tables and Topics from this paper

A Faster Interior Point Method for Semidefinite Programming
• Mathematics, Computer Science
• ArXiv
• 2020
• 8
• PDF
Riemannian Langevin Algorithm for Solving Semidefinite Programs
• Mathematics, Computer Science
• ArXiv
• 2020
• 1
• PDF

#### References

SHOWING 1-10 OF 48 REFERENCES
Phase recovery, MaxCut and complex semidefinite programming
• Mathematics, Computer Science
• Math. Program.
• 2015
• 442
• PDF
A Direct Formulation for Sparse PCA Using Semidefinite Programming
• Computer Science, Mathematics
• SIAM Rev.
• 2007
• 561
• PDF
Max-Cut based overlapping channel assignment for 802.11 multi-radio wireless mesh networks
• Weiqi Wang, Bo Liu
• Computer Science
• Proceedings of the 2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD)
• 2013
• 2
Rank minimization and applications in system theory
• Mathematics
• Proceedings of the 2004 American Control Conference
• 2004
• 220
• PDF
Minimizing finite sums with the stochastic average gradient
• Mathematics, Computer Science
• Math. Program.
• 2017
• 786
• PDF
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
• Mathematics, Computer Science
• 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
• 166
• PDF
Primal-dual subgradient methods for convex problems
• Y. Nesterov
• Mathematics, Computer Science
• Math. Program.
• 2009
• 694
• PDF