Almost Optimal Sublinear Time Algorithm for Semidefinite Programming
classification
🧮 math.OC
cs.DS
keywords
algorithmsemidefinitetimeoptimalrunningsublinearalmostapproximating
read the original abstract
We present an algorithm for approximating semidefinite programs with running time that is sublinear in the number of entries in the semidefinite instance. We also present lower bounds that show our algorithm to have a nearly optimal running time.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.