Carnegie Mellon University
Browse
- No file added yet -

Linear Programming Relaxations of Quadratically Constrained Quadratic Programs

Download (334.18 kB)
journal contribution
posted on 1999-02-01, 00:00 authored by Pietro Belotti, Francois MargotFrancois Margot, Andrea Qualizza
We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained quadratic problems. Classes of valid linear inequalities are presented, including sparse SDP cuts, and principal minors SDP cuts. Computational results based on instances from the literature are presented

History

Date

1999-02-01

Usage metrics

    Categories

    Keywords

    Quadratic ProgrammingSemidefinite ProgrammingrelaxationLinear Programming.

    Licence

    In Copyright

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC