Please use this identifier to cite or link to this item:
Title: Face reduction and the immobile indices approaches to regularization of linear Copositive Programming problems
Author: Kostyukova, O. I.
Tchemisova, T. V.
Keywords: Linear copositive programming
Strong duality
Normalized immobile index set
Minimal cone
Facial reduction
Constraint qualifications
Issue Date: 31-Aug-2021
Publisher: arXiv
Abstract: The paper is devoted to the regularization of linear Copositive Programming problems which consists of transforming a problem to an equivalent form, where the Slater condition is satisfied and the strong duality holds. We describe here two regularization algorithms based on the concept of immobile indices and an understanding of the important role these indices play in the feasible sets' characterization. These algorithms are compared to some regularization procedures developed for a more general case of convex problems and based on a facial reduction approach. We show that the immobile-index-based approach combined with the specifics of copositive problems allows us to construct more explicit and detailed regularization algorithms for linear Copositive Programming problems than those already available.
Peer review: no
Publisher Version:
Appears in Collections:CIDMA - Artigos
DMat - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
ArXiv-Tatiana.pdf10.22 MBAdobe PDFView/Open

Formato BibTex MendeleyEndnote Degois 

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