On the minimum volume simplex enclosure problem for estimating a linear mixing model

DOI10.1007/s10898-012-9876-5zbMath1272.90058OpenAlexW2027533473MaRDI QIDQ2392121

Antonio Plaza, Javier Plaza, Eligius M. T. Hendrix, Inmaculada F. García

Publication date: 1 August 2013

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-012-9876-5

zbMATH Keywords

estimationprincipal componentsapplicationspectral unmixingmaximum volumeminimum volumeendmembers

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (1)

Fast algorithms for the minimum volume estimator

Cites Work

• On the complexity of approximating the maximal inscribed ellipsoid for a polytope
• Introduction to nonlinear and global optimization
• Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
• Computation of Minimum-Volume Covering Ellipsoids
• Unnamed Item

This page was built for publication: On the minimum volume simplex enclosure problem for estimating a linear mixing model