Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complementarity and nondegeneracy in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lagrangian Relaxation of Quadratic Matrix Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2928409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5148358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust Lagrangian-DNN method for a class of quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fresh CP look at mixed-binary QPs: new formulations and relaxations / 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: On the copositive representation of binary and continuous nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the Stability Number of a Graph via Copositive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3843714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary quadratic optimization problems that are difficult to solve by conic relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Copositive Programming Approach to Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive and semidefinite relaxations of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the quadratic assignment problem using the bundle method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank

Latest revision as of 18:02, 17 July 2024

scientific article
Language Label Description Also known as
English
Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
scientific article

    Statements

    Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 December 2018
    0 references
    combinatorial quadratic optimization problems
    0 references
    binary and complementarity condition
    0 references
    completely positive relaxations
    0 references
    doubly nonnegative relaxations
    0 references
    semidefinite relaxations
    0 references
    equivalence of feasible regions
    0 references
    nondegeneracy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references