Jansson, ChristianChristianJansson2006-03-152006-03-152005http://tubdok.tub.tuhh.de/handle/11420/206We 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.enhttp://rightsstatements.org/vocab/InC/1.0/Linear programmingsemidefinite programmingcombinatorial optimizationrounding errorsill-posed problemsinterval arithmeticWorking Paper2006-03-15urn:nbn:de:gbv:830-opus-269610.15480/882.204Lineare OptimierungSemidefinite OptimierungKombinatorische Optimierung11420/20610.15480/882.204930767993Working Paper