4 papers
Computational complexity of sum-of-squares bounds for copositive programs
Marilena Palomba, Lucas Slot, Luis Felipe Vargas +1
In recent years, copositive programming has received significant attention for its ability to model hard problems in both discrete and continuous optimization. Several relaxations…
The Christoffel-Darboux kernel for topological data analysis
Pepijn Roos Hoefgeest, Lucas Slot
Persistent homology has been widely used to study the topology of point clouds in . Standard approaches are very sensitive to outliers, and their computational comple…
Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
Lucas Slot, Monique Laurent
We consider a hierarchy of upper approximations for the minimization of a polynomial over a compact set proposed recently by Lasserre (arXiv:1907.097…
Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets
Lucas Slot, Monique Laurent
We consider the problem of computing the minimum value of a polynomial over a compact set , which can be reformulated as finding a probab…