Please use this identifier to cite or link to this item: https://doi.org/10.15480/882.204
Fulltext available Open Access
DC FieldValueLanguage
dc.contributor.authorJansson, Christian-
dc.date.accessioned2006-03-15T17:19:49Zde_DE
dc.date.available2006-03-15T17:19:49Zde_DE
dc.date.issued2005-
dc.identifier.urihttp://tubdok.tub.tuhh.de/handle/11420/206-
dc.description.abstractWe 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.en
dc.language.isoende_DE
dc.rightsinfo:eu-repo/semantics/openAccess-
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subjectLinear programmingde_DE
dc.subjectsemidefinite programmingde_DE
dc.subjectcombinatorial optimizationde_DE
dc.subjectrounding errorsde_DE
dc.subjectill-posed problemsde_DE
dc.subjectinterval arithmeticde_DE
dc.titleTermination and verification for ill-posed semidefinite programming problemsde_DE
dc.typeWorking Paperde_DE
dc.date.updated2006-03-15T17:19:50Zde_DE
dc.identifier.urnurn:nbn:de:gbv:830-opus-2696de_DE
dc.identifier.doi10.15480/882.204-
dc.type.diniworkingPaper-
dc.subject.gndLineare Optimierungde
dc.subject.gndSemidefinite Optimierungde
dc.subject.gndKombinatorische Optimierungde
dc.subject.ddccode510-
dcterms.DCMITypeText-
tuhh.identifier.urnurn:nbn:de:gbv:830-opus-2696de_DE
tuhh.publikation.typworkingPaperde_DE
tuhh.opus.id269de_DE
tuhh.oai.showtruede_DE
dc.identifier.hdl11420/206-
tuhh.abstract.englishWe 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.de_DE
tuhh.publication.instituteZuverlässiges Rechnen E-19de_DE
tuhh.identifier.doi10.15480/882.204-
tuhh.type.opusResearchPaper-
tuhh.institute.germanZuverlässiges Rechnen E-19de
tuhh.institute.englishReliable Computing E-19en
tuhh.institute.id38de_DE
tuhh.type.id17de_DE
tuhh.gvk.hasppnfalse-
dc.type.driverworkingPaper-
dc.identifier.oclc930767993-
dc.type.casraiWorking Paper-
item.languageiso639-1en-
item.grantfulltextopen-
item.openairetypeWorking Paper-
item.cerifentitytypePublications-
item.creatorOrcidJansson, Christian-
item.fulltextWith Fulltext-
item.creatorGNDJansson, Christian-
item.openairecristypehttp://purl.org/coar/resource_type/c_8042-
crisitem.author.deptZuverlässiges Rechnen E-19-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
Appears in Collections:Publications with fulltext
Files in This Item:
File Description SizeFormat
Jansson.paper2.pdf207,83 kBAdobe PDFThumbnail
View/Open
Show simple item record

Page view(s)

276
Last Week
0
Last month
1
checked on Oct 19, 2020

Download(s)

78
checked on Oct 19, 2020

Google ScholarTM

Check

Note about this record

Export

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