Comment on: ``Approximation algorithms for quadratic programming'' (Q2165269): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114225854, #quickstatements; #temporary_batch_1714786519576
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Note on Polynomial Solvability of the CDT Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of quadratic programming with two quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: LMI approximations for the radius of the intersection of ellipsoids: Survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Generalized CDT Problems via Two-Parameter Eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation / rank
 
Normal rank

Revision as of 21:49, 29 July 2024

scientific article
Language Label Description Also known as
English
Comment on: ``Approximation algorithms for quadratic programming''
scientific article

    Statements

    Identifiers