Please use this identifier to cite or link to this item:
Title: Linear copositive programming: strong dual formulations and their properties
Author: Kostyukova, O.I.
Tchemisova, T.V.
Keywords: Conic optimization
Copositive programming
Constraint qualification
Strong duality
Issue Date: 2023
Publisher: Mathres
Abstract: In Copositive Programming, a cost function is optimized over a cone of matrices that are positive semidefinite in the non-negative ortant. Being a fairly new field of research, Copositive Programming has already gained popularity. Duality theory is a rich and powerful area of convex optimization, which is central to understanding sensitivity analysis and infeasibility issues as well as to development of numerical methods. In this paper, we continue our recent research on dual formulations for linear Copositive Programming. The dual problems obtained in the paper satisfy the strong duality relations and do not require any additional regularity assumptions such as constraint qualifications. Different dual formulations have their own special properties, the corresponding feasible sets are described in different ways, so they can have an independent application in practice.
Peer review: yes
DOI: 10.23952/cot.2023.3
ISSN: 2051-2053
Appears in Collections:CIDMA - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
COT20233.pdf133.72 kBAdobe PDFView/Open

Formato BibTex MendeleyEndnote Degois 

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