Real ideal and the duality of semidefinite programming for polynomial optimization

Simple item page
dc.creatorSekiguchi, Yoshiyuki
dc.creatorTakenawa, Tomoyuki
dc.creatorWaki, Hayato
dc.date2009-01-20
dc.date2009-02-14
dc.date.accessioned2026-07-07T12:41:05Z
dc.date.available2026-07-07T12:41:05Z
dc.descriptionWe study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial optimization problems with polynomial equality constraints can be modified equivalently so that the associated semidefinite programming relaxation problems have no duality gap. Elementary proofs for some criteria on reality of ideals are also given.
dc.description15 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/0901.2998
dc.identifierhttp://arxiv.org/abs/0901.2998
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219653
dc.subjectOptimization and Control
dc.subjectCommutative Algebra
dc.subject14P10; 12D15; 14P05; 90C22
dc.titleReal ideal and the duality of semidefinite programming for polynomial optimization
dc.typetext

Files

Collections

arXiv