scientific article; zbMATH DE number 7559394
From MaRDI portal
Publication:5089186
DOI10.4230/LIPIcs.MFCS.2020.23MaRDI QIDQ5089186
Chun-Hao Wang, Nai-Hui Chia, Tongyang Li, Han-Hsuan Lin
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1901.03254
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sublinear time algorithms for approximate semidefinite programming
- The ellipsoid method and its consequences in combinatorial optimization
- The Volumetric Barrier for Semidefinite Programming
- Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver
- Randomized algorithms in numerical linear algebra
- Polynomial Interior Point Cutting Plane Methods
- Semidefinite Programming
- Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing Quantum machine learning
- An improved cutting plane method for convex optimization, convex-concave games, and its applications
- A quantum-inspired classical algorithm for recommendation systems
- Solving linear programs in the current matrix multiplication time
- Shadow tomography of quantum states
- A parallel approximation algorithm for positive linear programming
- Logarithmic Regret Algorithms for Online Convex Optimization
- Fast monte-carlo algorithms for finding low-rank approximations
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- A Parallel Approximation Algorithm for Positive Semidefinite Programming
This page was built for publication:
