Regularization Algorithms for Linear Copositive Programming Problems: An Approach Based on the Concept of Immobile Indices

In this paper, we continue an earlier study of the regularization procedures of linear copositive problems and present new algorithms that can be considered as modifications of the algorithm described in our previous publication, which is based on the concept of immobile indices. The main steps of t...

Full description

Saved in:
Bibliographic Details
Published in:Algorithms 2022-02, Vol.15 (2), p.59
Main Authors: Kostyukova, Olga, Tchemisova, Tatiana
Format: Article
Language:English
Subjects:
Algorithms
facial reduction
linear copositive programming
minimal cone
normalized immobile index set
Optimization
Regularization
regularization algorithm
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we continue an earlier study of the regularization procedures of linear copositive problems and present new algorithms that can be considered as modifications of the algorithm described in our previous publication, which is based on the concept of immobile indices. The main steps of the regularization algorithms proposed in this paper are explicitly described and interpreted from the point of view of the facial geometry of the cone of copositive matrices. The results of the paper provide a deeper understanding of the structure of feasible sets of copositive problems and can be useful for developing a duality theory for these problems.
ISSN:1999-4893
1999-4893
DOI:10.3390/a15020059