  


Erratum to: ``On the setsemidefinite representation of nonconvex quadratic programs over arbitrary feasible sets'' [Optim. Letters, 2012]
Peter J.C. Dickinson (P.J.C.Dickinsonrug.nl) Abstract: In this paper, an erratum is provided to the article ``\emph{On the setsemidefinite representation of nonconvex quadratic programs over arbitrary feasible sets}'', published in Optim.\ Letters, 2012. Due to precise observation of the first author, it has been found that the proof of Lemma 9 has a nontrivial gap, and consequently the main result (Theorem 10) is incorrect. In this erratum, we prove that Corollary 14 is still correct in the original setting while to fix the proof of Theorem 10 we need additional assumptions. We provide a list of different commonly used assumptions making this theorem to be true, and a new version of this theorem, which is now Theorem 17. Keywords: setpositivity, semidenite programming, copositive programming, quadratic con straint, asymptotic cone Category 1: Convex and Nonsmooth Optimization Category 2: Linear, Cone and Semidefinite Programming Citation: Faculty of information studies in Novo mesto, Ulica talcev 3, SI8000, Novo mesto, 2012. Download: Entry Submitted: 08/22/2012 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  