Please use this identifier to cite or link to this item:
Title: On strong duality in linear copositive programming
Author: Kostyukova, O. I.
Tchemisova, T. V.
Keywords: Linear Copositive Programming
Strong duality
Normalized immobile index set
Extended dual problem
Constraint Qualification
Semi-infinite Programming (SIP)
Semidefinite programming (SDP)
Issue Date: 18-Feb-2021
Publisher: Springer
Abstract: The paper is dedicated to the study of strong duality for a problem of linear copositive programming. Based on the recently introduced concept of the set of normalized immobile indices, an extended dual problem is deduced. The dual problem satisfies the strong dual ity relations and does not require any additional regularity assumptions such as constraint qualifications. The main difference with the previously obtained results consists in the fact that now the extended dual problem uses neither the immobile indices themselves nor the explicit information about the convex hull of these indices. The strong duality formulations presented in the paper for linear copositive problems have similar structure and properties as that proposed in the works by M. Ramana, L. Tuncel, and H. Wolkowicz, for semidefinite programming.
Peer review: yes
DOI: 10.1007/s10898-021-00995-3
ISSN: 0925-5001
Appears in Collections:CIDMA - Artigos
DMat - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
Kostyukova-Tchemisova2021_Article_OnStrongDualityInLinearCoposit.pdf442.16 kBAdobe PDFrestrictedAccess

Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.