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 import...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/3044 |