Robust vertex enumeration for convex hulls in high dimensions

The problem of computing the vertices of the convex hull of a given input set S = { v i ∈ R m : i = 1 , ⋯ , n } is a classic and fundamental problem, studied in the context of computational geometry, linear and convex programming, machine learning and more. In this article we present All Vertex Tria...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of operations research Vol. 295; no. 1; pp. 37 - 73
Main Authors:	Awasthi, Pranjal, Kalantari, Bahman, Zhang, Yikai
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.12.2020 Springer Springer Nature B.V
Subjects:	Algorithms Angle Apexes Applications of mathematics Approximation Authorship Business and Management Clustering Combinatorics Complexity Computational geometry Convex surfaces Convexity Data processing Enumeration Euclidean geometry Factorization Greedy algorithms Hulls Lower bounds Machine learning Mathematical programming Matrix methods Measurement Operations research Operations Research/Decision Theory Original Research Parameter robustness Perturbation Robustness (mathematics) Technology application Theory of Computation Triangles Vertex sets United States Random projections Approximation algorithms Linear programming Convex hull membership Machine learning
ISSN:	0254-5330, 1572-9338
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!