Open source solver

Ensemble des solutions parcimonieuses exactes en démélange spectral : algorithme garanti et analyse des solutions

We focus on the exact resolution of sparse spectral unmixing problems, that is, the search for cardinality-limited linear least squares solutions under non-negativity and sum-to-one constraints.

Branch-and-bound algorithm for exact ℓ0-norm sparse spectral unmixing

We propose an algorithm that exactly solves the cardinality-constrained sparse spectral unmixing problem.