On the accuracy of uniform polyhedral approximations of the copositive cone
Alper Yildirim, E.
Optimization Methods and Software
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/21605
We consider linear optimization problems over the cone of copositive matrices. Such conic optimization problems, called copositive programs, arise from the reformulation of a wide variety of difficult optimization problems. We propose a hierarchy of increasingly better outer polyhedral approximations to the copositive cone. We establish that the sequence of approximations is exact in the limit. By combining our outer polyhedral approximations with the inner polyhedral approximations due to de Klerk and Pasechnik [SIAM J. Optim. 12 (2002), pp. 875-892], we obtain a sequence of increasingly sharper lower and upper bounds on the optimal value of a copositive program. Under primal and dual regularity assumptions, we establish that both sequences converge to the optimal value. For standard quadratic optimization problems, we derive tight bounds on the gap between the upper and lower bounds. We provide closed-form expressions of the bounds for the maximum stable set problem. Our computational results shed light on the quality of the bounds on randomly generated instances. © 2012 Taylor and Francis Group, LLC.
- Research Paper 
Showing items related by title, author, creator and subject.
Optimal signaling and detector design for power-constrained binary communications systems over non-Gaussian channels Göken, C.; Gezici, S.; Arikan, O. (2010)In this letter, joint optimization of signal structures and detectors is studied for binary communications systems under average power constraints in the presence of additive non-Gaussian noise. First, it is observed that ...
Urfaliog̃lu O.; Çetin, A.E.; Kuruog̃lu, E.E. (2008)A novel evolutionary global optimization approach based on adaptive covariance estimation is proposed. The proposed method samples from a multivariate Levy Skew Alpha-Stable distribution with the estimated covariance matrix ...
Gokbayrak, K.; Selvi O. (2010)We consider deterministic mixed-line flow shop systems that are composed of controllable and uncontrollable machines. Arrival times and completion deadlines of jobs are assumed to be known, and they are processed in the ...