On numerical testing of the regularity of semidefinite problems

Detalhes bibliográficos
Autor(a) principal: Macedo, Eloísa
Data de Publicação: 2013
Idioma: eng
Título da fonte: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Texto Completo: http://hdl.handle.net/10773/16488
Resumo: This paper is devoted to study regularity of Semidefinite Programming (SDP) problems. Current methods for SDP rely on assumptions of regularity such as constraint qualifications and wellposedness. Absence of regularity may compromise characterization of optimality and algorithms may present numerical difficulties. Prior that solving problems, one should evaluate the expected efficiency of algorithms. Therefore, it is important to have simple procedures that verify regularity. Here we use an algorithm to test regularity of linear SDP problems in terms of Slater’s condition. We present numerical tests using problems from SDPLIB and compare our results with those from others available in literature.
id RCAP_4e6bce4dd67c8cb18dae66e68fce48c0
oai_identifier_str oai:ria.ua.pt:10773/16488
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling On numerical testing of the regularity of semidefinite problemsConstraint qualificationsOptimality conditionsRegularitySemi-infinite programmingSemidefinite programmingWell-posednessThis paper is devoted to study regularity of Semidefinite Programming (SDP) problems. Current methods for SDP rely on assumptions of regularity such as constraint qualifications and wellposedness. Absence of regularity may compromise characterization of optimality and algorithms may present numerical difficulties. Prior that solving problems, one should evaluate the expected efficiency of algorithms. Therefore, it is important to have simple procedures that verify regularity. Here we use an algorithm to test regularity of linear SDP problems in terms of Slater’s condition. We present numerical tests using problems from SDPLIB and compare our results with those from others available in literature.Instituto Politécnico de Bragança2016-12-13T15:42:35Z2013-01-01T00:00:00Z2013conference objectinfo:eu-repo/semantics/publishedVersionapplication/pdfhttp://hdl.handle.net/10773/16488eng978-972-745-154-8Macedo, Eloísainfo:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2024-05-06T03:58:17Zoai:ria.ua.pt:10773/16488Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T13:52:46.047177Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv On numerical testing of the regularity of semidefinite problems
title On numerical testing of the regularity of semidefinite problems
spellingShingle On numerical testing of the regularity of semidefinite problems
Macedo, Eloísa
Constraint qualifications
Optimality conditions
Regularity
Semi-infinite programming
Semidefinite programming
Well-posedness
title_short On numerical testing of the regularity of semidefinite problems
title_full On numerical testing of the regularity of semidefinite problems
title_fullStr On numerical testing of the regularity of semidefinite problems
title_full_unstemmed On numerical testing of the regularity of semidefinite problems
title_sort On numerical testing of the regularity of semidefinite problems
author Macedo, Eloísa
author_facet Macedo, Eloísa
author_role author
dc.contributor.author.fl_str_mv Macedo, Eloísa
dc.subject.por.fl_str_mv Constraint qualifications
Optimality conditions
Regularity
Semi-infinite programming
Semidefinite programming
Well-posedness
topic Constraint qualifications
Optimality conditions
Regularity
Semi-infinite programming
Semidefinite programming
Well-posedness
description This paper is devoted to study regularity of Semidefinite Programming (SDP) problems. Current methods for SDP rely on assumptions of regularity such as constraint qualifications and wellposedness. Absence of regularity may compromise characterization of optimality and algorithms may present numerical difficulties. Prior that solving problems, one should evaluate the expected efficiency of algorithms. Therefore, it is important to have simple procedures that verify regularity. Here we use an algorithm to test regularity of linear SDP problems in terms of Slater’s condition. We present numerical tests using problems from SDPLIB and compare our results with those from others available in literature.
publishDate 2013
dc.date.none.fl_str_mv 2013-01-01T00:00:00Z
2013
2016-12-13T15:42:35Z
dc.type.driver.fl_str_mv conference object
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10773/16488
url http://hdl.handle.net/10773/16488
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 978-972-745-154-8
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 Instituto Politécnico de Bragança
publisher.none.fl_str_mv Instituto Politécnico de Bragança
dc.source.none.fl_str_mv reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833594159825420288

Registros relacionados