Certifying Solutions of Degenerate Semidefinite Programs
ACM Communications in Computer Algebra · 01.12.2025 · 59 (4) · 93-98
DOI: 10.1145/3832046.3832053 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Communications in Computer Algebra, online erschienen am 18.08.2026. Verfasst von Vladimir Kolmogorov und 2 weiteren Autor:innen. Die Arbeit nennt 10 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Kolmogorov, V., Naldi, S., & Zapata, J. (2025). Certifying Solutions of Degenerate Semidefinite Programs. ACM Communications in Computer Algebra, 59(4), 93-98. https://doi.org/10.1145/3832046.3832053
Vancouver
Kolmogorov V, Naldi S, Zapata J. Certifying Solutions of Degenerate Semidefinite Programs. ACM Communications in Computer Algebra. 2025;59(4):93-98. doi:10.1145/3832046.3832053
BibTeX
@article{Kolmogorov2025,
author = {Kolmogorov, Vladimir and Naldi, Simone and Zapata, Jeferson},
title = {Certifying Solutions of Degenerate Semidefinite Programs},
journal = {ACM Communications in Computer Algebra},
year = {2025},
volume = {59},
number = {4},
pages = {93--98},
doi = {10.1145/3832046.3832053}
}
EUVIMED