Solving SDP Faster: A Robust IPM Framework and Efficient Implementation-Reference-Cited by-同舟云学术

Solving SDP Faster: A Robust IPM Framework and Efficient Implementation

Published:2022-10 Issue: Volume: Page:
ISSN:
Container-title:2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Huang Baihe¹,Jiang Shunhua²,Song Zhao³,Tao Runzhou²,Zhang Ruizhe⁴

Affiliation:

1. Peking University

2. Columbia University

3. Adobe Research

4. UT-Austin

Publisher

IEEE

Link

Reference87 articles.

3. An algorithm for komlós conjecture matching banaszczyk;bansal;Annual IEEE Symposium on Foundations of Computer Science (FOCS),2016

4. The method of inscribed ellipsoids;khachiyan;Soviet Math Dokl,1988

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Matrix Completion in Almost-Verification Time;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. The Bit Complexity of Efficient Continuous Optimization;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06