New SDP roundings and certifiable approximation for cubic optimization

DOI10.1137/1.9781611977912.83MaRDI QIDQ6645442zbMATH OpenFDO

Authors Jun-Ting Hsieh, Pravesh Kothari, Lucas Pesenti, Luca Trevisan

Publication date 28 November 2024

Full work available at URL https://doi.org/10.1137/1.9781611977912.83

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Certifying Euclidean sections and finding planted sparse vectors beyond the \(\sqrt{n}\) dimension threshold

This page was built for publication: New SDP roundings and certifiable approximation for cubic optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645442)