Tightening a copositive relaxation for standard quadratic optimization problems (Q2376121): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-012-9522-7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: D.C. versus copositive bounds for standard QP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable representations for convex hulls of low-dimensional quadratic forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 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: On copositive programming and standard quadratic optimization problems / 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: Copositive programming motivated bounds on the stability and the chromatic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Convex Quadratic Characterization of the Lovász Theta Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Matrix Equation <i>X</i>′<i>X</i> = <i>A</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of the Delsarte and Lovász bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On duality gap in binary quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-012-9522-7 / rank
 
Normal rank

Latest revision as of 06:54, 18 December 2024

scientific article
Language Label Description Also known as
English
Tightening a copositive relaxation for standard quadratic optimization problems
scientific article

    Statements

    Tightening a copositive relaxation for standard quadratic optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2013
    0 references
    standard quadratic optimization problem
    0 references
    Shor's relaxation
    0 references
    semidefinite programming
    0 references
    duality gap
    0 references
    minimal vertex cover
    0 references
    second-order cone program
    0 references

    Identifiers