A note on approximating quadratic programming with rank constraint (Q2903138): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Positive definite functions on spheres / rank | |||
Normal rank | |||
Latest revision as of 14:46, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on approximating quadratic programming with rank constraint |
scientific article |
Statements
A note on approximating quadratic programming with rank constraint (English)
0 references
23 August 2012
0 references
feasible solution
0 references
relative approximation ratio
0 references
0 references
0 references
