Please use this identifier to cite or link to this item: https://doi.org/10.15480/882.205
Fulltext available Open Access
Title: Rigorous error bounds for the optimal value in semidefinite programming
Language: English
Authors: Jansson, Christian 
Keil, Christian 
Keywords: semidefinite programming;global optimization;combinatorial optimization
Issue Date: 2005
Abstract (english): A wide variety of problems in global optimization, combinatorial optimization as well as systems and control theory can be solved by using linear and semidefinite programming. Sometimes, due to the use of floating point arithmetic in combination with ill-conditioning and degeneracy, erroneous results may be produced. The purpose of this article is to show how rigorous error bounds for the optimal value can be computed by carefully postprocessing the output of a linear or semidefinite programming solver. It turns out that in many cases the computational costs for postprocessing are small compared to the effort required by the solver. Numerical results are presented including problems from the SDPLIB and the NETLIB LP library; these libraries contain many ill-conditioned and real life problems.
URI: http://tubdok.tub.tuhh.de/handle/11420/207
DOI: 10.15480/882.205
Institute: Zuverlässiges Rechnen E-19 
Type: ResearchPaper
License: In Copyright In Copyright
Appears in Collections:Publications with fulltext

Files in This Item:
File Description SizeFormat
Jansson.paper3.pdf232,15 kBAdobe PDFThumbnail
View/Open
Show full item record

Page view(s)

642
Last Week
2
Last month
10
checked on Sep 27, 2020

Download(s)

335
checked on Sep 27, 2020

Google ScholarTM

Check

Note about this record

Export

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