Computational Experience with Ill-Posed Problems in Semidefinite Programming |
| |
Authors: | Gerald Gruber Franz Rendl |
| |
Institution: | (1) Institut für Mathematik, Universitöt Klagenfurt, Universitötsstraße 65-67, A-9020 Klagenfurt, Austria |
| |
Abstract: | Many theoretical and algorithmic results in semidefinite programming are based on the assumption that Slater's constraint qualification is satisfied for the primal and the associated dual problem. We consider semidefinite problems with zero duality gap for which Slater's condition fails for at least one of the primal and dual problem. We propose a numerically reasonable way of dealing with such semidefinite programs. The new method is based on a standard search direction with damped Newton steps towards primal and dual feasibility. |
| |
Keywords: | semidefinite programming interior point method constraint qualification |
本文献已被 SpringerLink 等数据库收录! |