Stratifying High-Dimensional Data Based on Proximity to the Convex Hull Boundary

DOI10.1137/15M1047921zbMath1371.90097arXiv1611.01419MaRDI QIDQ5738132

No author found.

Publication date: 31 May 2017

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.01419

zbMATH Keywords

optimizationconvex hullquadratic program

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Related Items

Sparse probabilistic K-means, Elastic trend filtering

Uses Software

• Qhull

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• On the complexity of d-dimensional Voronoi diagrams
• Linear programming: foundations and extensions
• Principal component analysis.
• The Split Bregman Method for L1-Regularized Problems
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Spatial Planning: A Configuration Space Approach
• Computational Geometry in C
• Archetypal Analysis
• The quickhull algorithm for convex hulls
• Regularization and Variable Selection Via the Elastic Net
• Sparse Demixing of Hyperspectral Images