Certifying solutions of degenerate semidefinite programs Kolmogorov, Vladimir Naldi, Simone Zapata, Jeferson We consider the problem of certifying the feasibility of a (possibly degenerate) semidefinite programming problem represented by rational input data together with a numerical solution that is guaranteed to be sufficiently close to an exact solution of maximal rank. Our method constructs a polynomial system whose set of real solutions has an isolated point that satisfies the input program. An experimental comparison between the corresponding symbolic-numerical algorithm and the purely symbolic algorithm from [3, 5] shows that the hybrid algorithm is able to certify instances where the exact method fails. ACM 2025 info:eu-repo/semantics/article doc-type:article article http://purl.org/coar/resource_type/c_2df8fbb1 https://research-explorer.ista.ac.at/record/22774 Kolmogorov V, Naldi S, Zapata J. Certifying solutions of degenerate semidefinite programs. <i>ACM Communications in Computer Algebra</i>. 2025;59(4):147-152. doi:<a href="https://doi.org/10.1145/3832046.3832063">10.1145/3832046.3832063</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1145/3832046.3832063 info:eu-repo/semantics/altIdentifier/issn/1932-2232 info:eu-repo/semantics/altIdentifier/e-issn/1932-2240 info:eu-repo/semantics/openAccess