2 papers
math.AG2026
On semidefinite-representable sets over valued fields
Corentin Cornou, Simone Naldi, Tristan Vaccon
Polyhedra and spectrahedra over the real numbers, or more generally their images under linear maps, are respectively the feasible sets of linear and semidefinite programming, and f…
math.OC2025
Certifying solutions of degenerate semidefinite programs
Vladimir Kolmogorov, Simone Naldi, Jeferson Zapata
This paper deals with the algorithmic aspects of solving feasibility problems of semidefinite programming (SDP), aka linear matrix inequalities (LMI). Since in some SDP instances a…