A faster interior point method for semidefinite programming

DOI10.1109/FOCS46700.2020.00089MaRDI QIDQ6943966zbMATH OpenFDO

Authors Tarun Kathuria, Swati Padmanabhan, Yin Tat Lee, Haotian Jiang, Zhao Song

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00089

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(10)

• The bit complexity of dynamic algebraic formulas and their determinants
• Training multi-layer over-parametrized neural network in subquadratic time
• Dimension-independent kernel -covers
• Estimating the matrix p q norm
• Optirefine: densest subgraphs and maximum cuts with k refinements
• RedEx: beyond fixed representation methods via convex optimization
• On spectral and nuclear norms of order three tensors with one fixed dimension
• Sum-of-squares programming for Ma-Trudinger-Wang regularity of optimal transport maps
• Quantum computing inspired iterative refinement for semidefinite optimization
• Submodular hypergraph partitioning: metric relaxations and fast algorithms via an improved cut-matching game

This page was built for publication: A faster interior point method for semidefinite programming

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