activity
20242026
collaborators

6 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 , a factorization rank and {a positive integer }, entrywise power matrix factorization (EPMF) looks for a low-rank matrix such that $X =…

math.OC2026

Manifold-based Algorithms for the Hadamard Decomposition

Nicolas Gillis, Subhayan Saha, Stefano Sicilia +1

Given a matrix , and two ranks and , the Hadamard decomposition (HD) looks for two low-rank matrices, of rank and of rank , 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 , with a prescribed linear structure (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.NA2024

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

Nicolas Gillis, Stefano Sicilia

Given two matrices and a set , a Procrustes problem consists in finding a matrix su…

math.NA2024

Stabilization of a matrix via a low rank-adaptive ODE

Nicola Guglielmi, Stefano Sicilia

Let be a square matrix with a given structure (e.g. real matrix, sparsity pattern, Toeplitz structure, etc.) and assume that it is unstable, i.e. at least one of its eigenvalue…