Comment on: ``Approximation algorithms for quadratic programming
From MaRDI portal
Publication:2165269
DOI10.1007/s10878-022-00881-yzbMath1492.90116arXiv2110.10449OpenAlexW3207578126WikidataQ114225854 ScholiaQ114225854MaRDI QIDQ2165269
Publication date: 19 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.10449
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for quadratic programming
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
- On the complexity of quadratic programming with two quadratic constraints
- A Note on Polynomial Solvability of the CDT Problem
- Solving Generalized CDT Problems via Two-Parameter Eigenvalues
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- LMI approximations for the radius of the intersection of ellipsoids: Survey.
This page was built for publication: Comment on: ``Approximation algorithms for quadratic programming