Implicit optimality criterion for convex SIP problem with box constrained index set

Detalhes bibliográficos
Autor(a) principal: Kostyukova, O. I.
Data de Publicação: 2012
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/6181
Resumo: We consider a convex problem of Semi-Infinite Programming (SIP) with multidimensional index set. In study of this problem we apply the approach suggested in [20] for convex SIP problems with one-dimensional index sets and based on the notions of immobile indices and their immobility orders. For the problem under consideration we formulate optimality conditions that are explicit and have the form of criterion. We compare this criterion with other known optimality conditions for SIP and show its efficiency in the convex case.
id RCAP_ccd8d769e23dec4ea501baed3d14d68d
oai_identifier_str oai:ria.ua.pt:10773/6181
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 Implicit optimality criterion for convex SIP problem with box constrained index setSemi-Infinite Programming (SIP)Semi-Definite Programming (SDP)Constraint qualifications (CQ)Immobile indexOptimality conditionsWe consider a convex problem of Semi-Infinite Programming (SIP) with multidimensional index set. In study of this problem we apply the approach suggested in [20] for convex SIP problems with one-dimensional index sets and based on the notions of immobile indices and their immobility orders. For the problem under consideration we formulate optimality conditions that are explicit and have the form of criterion. We compare this criterion with other known optimality conditions for SIP and show its efficiency in the convex case.Springer Verlag2012-02-10T12:37:56Z2012-07-01T00:00:00Z2012-07info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfapplication/pdfhttp://hdl.handle.net/10773/6181eng1134-576410.1007/s11750-011-0189-5Kostyukova, 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-22T11:09:49Zoai:ria.ua.pt:10773/6181Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T02:44:04.845972Repositó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 Implicit optimality criterion for convex SIP problem with box constrained index set
title Implicit optimality criterion for convex SIP problem with box constrained index set
spellingShingle Implicit optimality criterion for convex SIP problem with box constrained index set
Kostyukova, O. I.
Semi-Infinite Programming (SIP)
Semi-Definite Programming (SDP)
Constraint qualifications (CQ)
Immobile index
Optimality conditions
title_short Implicit optimality criterion for convex SIP problem with box constrained index set
title_full Implicit optimality criterion for convex SIP problem with box constrained index set
title_fullStr Implicit optimality criterion for convex SIP problem with box constrained index set
title_full_unstemmed Implicit optimality criterion for convex SIP problem with box constrained index set
title_sort Implicit optimality criterion for convex SIP problem with box constrained index set
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 Semi-Infinite Programming (SIP)
Semi-Definite Programming (SDP)
Constraint qualifications (CQ)
Immobile index
Optimality conditions
topic Semi-Infinite Programming (SIP)
Semi-Definite Programming (SDP)
Constraint qualifications (CQ)
Immobile index
Optimality conditions
description We consider a convex problem of Semi-Infinite Programming (SIP) with multidimensional index set. In study of this problem we apply the approach suggested in [20] for convex SIP problems with one-dimensional index sets and based on the notions of immobile indices and their immobility orders. For the problem under consideration we formulate optimality conditions that are explicit and have the form of criterion. We compare this criterion with other known optimality conditions for SIP and show its efficiency in the convex case.
publishDate 2012
dc.date.none.fl_str_mv 2012-02-10T12:37:56Z
2012-07-01T00:00:00Z
2012-07
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/6181
url http://hdl.handle.net/10773/6181
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 1134-5764
10.1007/s11750-011-0189-5
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer Verlag
publisher.none.fl_str_mv Springer Verlag
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_ 1799137491390824448

Registros relacionados