Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/33967
Title: | Regularization algorithms for linear copositive programming problems: an Approach based on the concept of immobile indices |
Author: | Kostyukova, Olga Tchemisova, Tatiana |
Keywords: | Linear copositive programming Normalized immobile index set Regularization algorithm Minimal cone Facial reduction |
Issue Date: | Feb-2022 |
Publisher: | MDPI |
Abstract: | 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. |
Peer review: | yes |
URI: | http://hdl.handle.net/10773/33967 |
DOI: | 10.3390/a15020059 |
Appears in Collections: | CIDMA - Artigos DMat - Artigos OGTCG - Artigos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Published Paper Algorithms 2022.pdf | 5.51 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.