On Doubly Positive Semidefinite Programming Relaxations Dongdong Ge

@inproceedings{Ye2010OnDP,
  title={On Doubly Positive Semidefinite Programming Relaxations Dongdong Ge},
  author={Yinyu Ye},
  year={2010}
}
Recently, researchers have been interested in studying the semidefinite programming (SDP) relaxation model, where the matrix is both positive semidefinite and entry-wise nonnegative, for quadratically constrained quadratic programming (QCQP). Comparing to the basic SDP relaxation, this doubly-positive SDP model possesses additional O(n2) constraints, which makes the SDP solution complexity substantially higher than that for the basic model with O(n) constraints. In this paper, we prove that the… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Convex Relaxations for Nonconvex Quadratically Constrained Quadratic Programming: Cone-Specific Best Decomposition and Polyhedral Convexification

  • X. J. Zheng, X. L. Sun, D. Li
  • Manuscript
  • 2010
1 Excerpt

X

  • X. J. Zheng
  • L. Sun and D. Li, Nonconvex Quadratically…
  • 2010
2 Excerpts

versus copositive boundeds for standard QP

  • K. Anstreicher, D.C.S. Burer
  • J. Global Optim.,
  • 2009
1 Excerpt

Similar Papers

Loading similar papers…