Stefano Sicilia

collaborators

5 papers

cs.CC2026

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization

Nicolas Gillis, Subhayan Saha, Stefano Sicilia +1

Given a nonnegative matrix $X$ , a factorization rank $r$ and {a positive integer $p$ }, entrywise power matrix factorization (EPMF) looks for a low-rank matrix $X_{r}$ such that $X =…

math.OC2026

Manifold-based Algorithms for the Hadamard Decomposition

Nicolas Gillis, Subhayan Saha, Stefano Sicilia +1

Given a matrix $X$ , and two ranks $r_{1}$ and $r_{2}$ , the Hadamard decomposition (HD) looks for two low-rank matrices, $X_{1}$ of rank $r_{1}$ and $X_{2}$ of rank $r_{2}$ , both of the same si…

math.NA2026

Structured distance to singularity as a nonlinear system of equations

Miryam Gnazzo, Nicola Guglielmi, Federico Poloni +1

In this article we study the structured distance to singularity for a nonsingular matrix $A \in C^{n \times n}$ , with a prescribed linear structure $S$ (for instanc…

math.NA2025

Improving the robustness of neural ODEs with minimal weight perturbation

Arturo De Marinis, Nicola Guglielmi, Stefano Sicilia +1

We propose a method to enhance the stability of a neural ordinary differential equation (neural ODE) by reducing the maximum error growth subsequent to a perturbation of the initia…

math.NA2025

Minimum-norm solutions of the non-symmetric semidefinite Procrustes problem

Nicolas Gillis, Stefano Sicilia

Given two matrices $X, B \in R^{n \times m}$ and a set $A \subseteq R^{n \times n}$ , a Procrustes problem consists in finding a matrix $A \in A$ su…