Face reduction and the immobile indices approaches to regularization of linear Copositive Programming problems

Detalhes bibliográficos
Autor(a) principal: Kostyukova, O. I.
Data de Publicação: 2021
Outros Autores: Tchemisova, T. V.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10773/32055
Resumo: 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.
id RCAP_eace5899825904b3a0d067c6bcc0ae0e
oai_identifier_str oai:ria.ua.pt:10773/32055
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Face reduction and the immobile indices approaches to regularization of linear Copositive Programming problemsLinear copositive programmingStrong dualityNormalized immobile index setRegularizationMinimal coneFacial reductionConstraint qualificationsThe 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.arXiv2021-09-06T17:21:13Z2021-08-31T00:00:00Z2021-08-31info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/32055engKostyukova, O. I.Tchemisova, T. V.info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-02-22T12:02:00Zoai:ria.ua.pt:10773/32055Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T03:03:53.838360Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Face reduction and the immobile indices approaches to regularization of linear Copositive Programming problems
title Face reduction and the immobile indices approaches to regularization of linear Copositive Programming problems
spellingShingle Face reduction and the immobile indices approaches to regularization of linear Copositive Programming problems
Kostyukova, O. I.
Linear copositive programming
Strong duality
Normalized immobile index set
Regularization
Minimal cone
Facial reduction
Constraint qualifications
title_short Face reduction and the immobile indices approaches to regularization of linear Copositive Programming problems
title_full Face reduction and the immobile indices approaches to regularization of linear Copositive Programming problems
title_fullStr Face reduction and the immobile indices approaches to regularization of linear Copositive Programming problems
title_full_unstemmed Face reduction and the immobile indices approaches to regularization of linear Copositive Programming problems
title_sort Face reduction and the immobile indices approaches to regularization of linear Copositive Programming problems
author Kostyukova, O. I.
author_facet Kostyukova, O. I.
Tchemisova, T. V.
author_role author
author2 Tchemisova, T. V.
author2_role author
dc.contributor.author.fl_str_mv Kostyukova, O. I.
Tchemisova, T. V.
dc.subject.por.fl_str_mv Linear copositive programming
Strong duality
Normalized immobile index set
Regularization
Minimal cone
Facial reduction
Constraint qualifications
topic Linear copositive programming
Strong duality
Normalized immobile index set
Regularization
Minimal cone
Facial reduction
Constraint qualifications
description 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.
publishDate 2021
dc.date.none.fl_str_mv 2021-09-06T17:21:13Z
2021-08-31T00:00:00Z
2021-08-31
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10773/32055
url http://hdl.handle.net/10773/32055
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv arXiv
publisher.none.fl_str_mv arXiv
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799137694294474752

Registros relacionados