Please use this identifier to cite or link to this item:
Title: On numerical testing of the regularity of semidefinite problems
Author: Macedo, Eloísa
Keywords: Constraint qualifications
Optimality conditions
Semi-infinite programming
Semidefinite programming
Issue Date: 2013
Publisher: Instituto Politécnico de Bragança
Abstract: 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.
Peer review: yes
ISBN: 978-972-745-154-8
Publisher Version:
Appears in Collections:CIDMA - Comunicações

Files in This Item:
File Description SizeFormat 
macedo_RegularitySDP_IO2013proceedings_posprint.pdf466.49 kBAdobe PDFView/Open

Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.