Regularization algorithms for linear copositive problems
Autor(a) principal: | |
---|---|
Data de Publicação: | 2022 |
Outros Autores: | |
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/36132 |
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 therefore the strong duality holds. We describe regularization algorithms based on a concept of immobile indices and on the understanding of the important role that 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 con struct more explicit and detailed regularization algorithms for linear Copositive Programming problems than those already available. |
id |
RCAP_23cf029127ab0ba37c14fa886b3afc41 |
---|---|
oai_identifier_str |
oai:ria.ua.pt:10773/36132 |
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 |
Regularization algorithms for linear copositive 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 therefore the strong duality holds. We describe regularization algorithms based on a concept of immobile indices and on the understanding of the important role that 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 con struct more explicit and detailed regularization algorithms for linear Copositive Programming problems than those already available.DP Sciences2023-01-31T12:36:10Z2022-01-01T00:00:00Z2022info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/36132eng0399-055910.1051/ro/2022063Kostyukova, Olga I.Tchemisova, Tatiana 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:08:49Zoai:ria.ua.pt:10773/36132Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T03:06:41.191845Repositó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 |
Regularization algorithms for linear copositive problems |
title |
Regularization algorithms for linear copositive problems |
spellingShingle |
Regularization algorithms for linear copositive problems Kostyukova, Olga I. Linear copositive programming Strong duality Normalized immobile index set Regularization Minimal cone Facial reduction Constraint qualifications |
title_short |
Regularization algorithms for linear copositive problems |
title_full |
Regularization algorithms for linear copositive problems |
title_fullStr |
Regularization algorithms for linear copositive problems |
title_full_unstemmed |
Regularization algorithms for linear copositive problems |
title_sort |
Regularization algorithms for linear copositive problems |
author |
Kostyukova, Olga I. |
author_facet |
Kostyukova, Olga I. Tchemisova, Tatiana V. |
author_role |
author |
author2 |
Tchemisova, Tatiana V. |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Kostyukova, Olga I. Tchemisova, Tatiana 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 therefore the strong duality holds. We describe regularization algorithms based on a concept of immobile indices and on the understanding of the important role that 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 con struct more explicit and detailed regularization algorithms for linear Copositive Programming problems than those already available. |
publishDate |
2022 |
dc.date.none.fl_str_mv |
2022-01-01T00:00:00Z 2022 2023-01-31T12:36:10Z |
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/36132 |
url |
http://hdl.handle.net/10773/36132 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
0399-0559 10.1051/ro/2022063 |
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 |
DP Sciences |
publisher.none.fl_str_mv |
DP Sciences |
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_ |
1799137722471809024 |