Exact SDP relaxations for quadratic programs with bipartite graph structures (Q6173960): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Exact SDP relaxations of quadratically constrained quadratic programs with forest structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: JuMP: A Modeling Language for Mathematical Optimization / 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: Nonchordal positive semidefinite stochastic matrices<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Sparsity in SDP Relaxation for Sensor Network Localization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exactness conditions for an SDP relaxation of the extended trust region problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of the S-Lemma / 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: Theory of semidefinite programming for sensor network localization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong duality for generalized trust region subproblem: S-lemma with interval bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank

Revision as of 18:21, 1 August 2024

scientific article; zbMATH DE number 7712381
Language Label Description Also known as
English
Exact SDP relaxations for quadratic programs with bipartite graph structures
scientific article; zbMATH DE number 7712381

    Statements

    Exact SDP relaxations for quadratic programs with bipartite graph structures (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 July 2023
    0 references
    quadratically constrained quadratic programs
    0 references
    exact semidefinite relaxations
    0 references
    bipartite graph
    0 references
    sign-indefinite QCQPs
    0 references
    rank of aggregated sparsity matrix
    0 references
    0 references

    Identifiers

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