activity
20122025
most citedReal root finding for low rank linear matrices

7 citations · 26 across the 13 of their papers we have counts for

collaborators

16 papers

cs.SC2025

Solving generic parametric linear matrix inequalities

Simone Naldi, Mohab Safey El Din, Adrien Taylor +1

We consider linear matrix inequalities (LMIs) with the 's being symmetric matrices, with entries in a ring $\mathcal…

math.AG2023

Taylor Polynomials of Rational Functions

Aldo Conca, Simone Naldi, Giorgio Ottaviani +1

A Taylor variety consists of all fixed order Taylor polynomials of rational functions, where the number of variables and degrees of numerators and denominators are fixed. In one va…

math.AG2023

Algebraic certificates for the truncated moment problem

Didier Henrion, Simone Naldi, Mohab Safey El Din

The truncated moment problem consists of determining whether a given finitedimensional vector of real numbers y is obtained by integrating a basis of the vector space of polynomial…

math.AG2022★ 1 cited

Urysohn in action: separating semialgebraic sets by polynomials

Milan Korda, Jean-Bernard Lasserre, Alexey Lazarev +2

A classical result from topology called Uryshon's lemma asserts the existence of a continuous separator of two disjoint closed sets in a sufficiently regular topological space. In…

cs.SC2020★ 3 cited

A divide-and-conquer algorithm for computing Gröbner bases of syzygies in finite dimension

Simone Naldi, Vincent Neiger

Let be elements in a quotient which has finite dimension as a -vector space, where and is an -submodule of . We ad…

math.OC2018

Conic programming: infeasibility certificates and projective geometry

Simone Naldi, Rainer Sinn

We revisit facial reduction from the point of view of projective geometry. This leads us to a homogenization strategy in conic programming that eliminates the phenomenon of weak in…