Jansson, ChristianChristianJansson2006-03-152006-03-152006Algebraic and Numerical Algorithms and Computer-assisted Proofs. Dagstuhl, 2006 (Dagstuhl Seminar Proceedings ; 05391) ; http://drops.dagstuhl.de/opus/volltexte/2006/446/001500090http://tubdok.tub.tuhh.de/handle/11420/205Many current deterministic solvers for NP-hard combinatorial optimization problems are based on nonlinear relaxation techniques that use floating point arithmetic. Occasionally, due to solving these relaxations, rounding errors may produce erroneous results, although the deterministic algorithm should compute the exact solution in a finite number of steps. This may occur especially if the relaxations are illconditioned or ill-posed, and if Slater’s constraint qualifications fail. We show how verified results can be obtained by rigorously bounding the optimal value of nonlinear semidefinite relaxations, even in the ill-posed case. All rounding errors due to floating point arithmetic are taken into account.enhttp://rightsstatements.org/vocab/InC/1.0/Combinatorial OptimizationSemidefinite Programmingillposed problemsbranch-and-boundinterval arithmeticConference Paper2006-03-17urn:nbn:de:101:1-20150409402810.15480/882.203Semidefinite OptimierungKombinatorische Optimierung11420/20510.15480/882.203930768016Conference Paper