A note on approximating quadratic programming with rank constraint (Q2903138): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q652698
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Sheng-Long Hu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331934.2010.523111 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995594370 / rank
 
Normal rank
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 13: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

    Identifiers