Titel: Termination and verification for ill-posed semidefinite programming problems
Sprache: English
Autor/Autorin: Jansson, Christian 
Schlagwörter: Linear programming;semidefinite programming;combinatorial optimization;rounding errors;ill-posed problems;interval arithmetic
Erscheinungsdatum: 2005
Zusammenfassung (englisch): We investigate ill-posed semidefinite programming problems for which Slater's constraint qualifications fail, and propose a new reliable termination criterium dealing with such problems. This criterium is scale-independent and provides verified forward error bounds for the true optimal value, where all rounding errors due to floating point arithmetic are taken into account. It is based on a boundedness qualification, which is satisfied for many problems. Numerical experiments, including combinatorial problems, are presented.
URI: http://tubdok.tub.tuhh.de/handle/11420/206
DOI: 10.15480/882.204
Institut: Zuverlässiges Rechnen E-19 
Dokumenttyp: ResearchPaper
Enthalten in den Sammlungen:Publications (tub.dok)

Dateien zu dieser Ressource:
Datei Beschreibung GrößeFormat
Jansson.paper2.pdf207,83 kBAdobe PDFMiniaturbild
Öffnen/Anzeigen
Zur Langanzeige

Seitenansichten

245
Letzte Woche
0
Letzten Monat
6
checked on 22.03.2019

Download(s)

64
checked on 22.03.2019

Google ScholarTM

Prüfe

Export

Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt.