Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball (Q2458903): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: D.C. versus copositive bounds for standard QP / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3843714 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3371140 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On copositive programming and standard quadratic optimization problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem / rank | |||
Normal rank |
Revision as of 11:32, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball |
scientific article |
Statements
Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball (English)
0 references
5 November 2007
0 references
0 references
0 references