Please use this identifier to cite or link to this item:
Title: An exact explicit dual for the linear copositive programming problem
Author: Kostyukova, O. I.
Tchemisova, T. V.
Keywords: Linear Copositive Programming
Strong duality
Normalized immobile index set
Extended dual problem
Constraint qualifications
Issue Date: 18-Mar-2022
Publisher: Springer
Abstract: Recently, for a linear copositive programming problem, we formulated an exact explicit dual problem in the form of the extended Lagrange-Slater dual. This dual problem is formulated using only the data of the primal copositive problem, satisfies the strong duality relation, and is obtained without any regularity assumptions due to the use of a concept of the normalized immobile index set. The constraints of the exact explicit dual problem are formulated in terms of completely positive matrices and their number is presented in terms of a finite integer parameter m_0. In this paper, we prove that m_0≤2n, where n is the dimension of the primal variable’s space.
Peer review: yes
DOI: 10.1007/s11590-022-01870-0
ISSN: 1862-4472
Appears in Collections:CIDMA - Artigos
DMat - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
Optimization Letters2022-published.pdf322.87 kBAdobe PDFrestrictedAccess

Formato BibTex MendeleyEndnote Degois 

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