Please use this identifier to cite or link to this item:
Title: Immobile indices and CQ-free optimality criteria for linear copositive programming problems
Author: Kostyukova, O. I.
Tchemisova, T. V.
Dudina, O. S.
Keywords: Semi-infinite programming
Copositive programming
Optimality conditions
Constraint qualification
Normalized immobile index set
Strong duality
Issue Date: Mar-2020
Publisher: Springer
Abstract: We consider problems of linear copositive programming where feasible sets consist of vectors for which the quadratic forms induced by the corresponding linear matrix combinations are nonnegative over the nonnegative orthant. Given a linear copositive problem, we define immobile indices of its constraints and a normalized immobile index set. We prove that the normalized immobile index set is either empty or can be represented as a union of a finite number of convex closed bounded polyhedra. We show that the study of the structure of this set and the connected properties of the feasible set permits to obtain new optimality criteria for copositive problems. These criteria do not require the fulfillment of any additional conditions (constraint qualifications or other). An illustrative example shows that the optimality conditions formulated in the paper permit to detect the optimality of feasible solutions for which the known sufficient optimality conditions are not able to do this. We apply the approach based on the notion of immobile indices to obtain new formulations of regularized primal and dual problems which are explicit and guarantee strong duality.
Peer review: yes
DOI: 10.1007/s11228-019-00527-y
ISSN: 1877-0533
Appears in Collections:CIDMA - Artigos
DMat - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
Set-valued published 2019.pdf500.34 kBAdobe PDFView/Open

Formato BibTex MendeleyEndnote Degois 

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