Browsing by Subject "Semidefinite programming relaxation"
Now showing 1 - 1 of 1
- Results Per Page
- Sort Options
Item Open Access On semidefinite bounds for maximization of a non-convex quadratic objective over the ℓ1 unit ball(E D P Sciences, 2006) Pınar, M. Ç.; Teboulle, M.We consider the non-convex quadratic maximization problem subject to the ℓ1 unit ball constraint. The nature of the l1 norm structure makes this problem extremely hard to analyze, and as a consequence, the same difficulties are encountered when trying to build suitable approximations for this problem by some tractable convex counterpart formulations. We explore some properties of this problem, derive SDP-like relaxations and raise open questions.