Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Quadratic Matrix Programming"”.

  1. On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming

    Two important topics in the study of Quadratically Constrained Quadratic Programming (QCQP) are how to exactly solve a QCQP with few constraints in polynomial time and how to find an inexpensive and strong relaxation bound for a QCQP with many constraints. In this thesis, we first review some …

    waterloo Repository record for On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming (opens in a new tab)