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

DOI10.1007/S10898-012-9876-5MaRDI QIDQ2392121zbMATH OpenOpenAlexFDO

Authors Javier Plaza, Antonio Plaza, E. M. T. Hendrix, I. García

Publication date 1 August 2013

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

applicationendmembersestimationmaximum volumeminimum volumeprincipal componentsspectral unmixing

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
• Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
• On statistical learning of simplices: unmixing problem revisited
• scientific article; zbMATH DE number 1445342
• Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids

Cites work

• Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
• Computation of Minimum-Volume Covering Ellipsoids
• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• Introduction to nonlinear and global optimization
• On the complexity of approximating the maximal inscribed ellipsoid for a polytope

Cited in

(1)

• Fast algorithms for the minimum volume estimator

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392121)