Robust vertex enumeration for convex hulls in high dimensions
From MaRDI portal
Publication:827269
DOI10.1007/s10479-020-03557-0OpenAlexW3011650895MaRDI QIDQ827269
Yikai Zhang, Pranjal Awasthi, Bahman Kalantari
Publication date: 7 January 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.01515
Learning and adaptive systems in artificial intelligence (68T05) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (3)
Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries ⋮ Guaranteed deterministic approach to superhedging: a numerical experiment ⋮ First-order methods for the convex hull membership problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- An optimal convex hull algorithm in any fixed dimension
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Output-sensitive results on convex hulls, extreme points, and related problems
- A characterization theorem and an algorithm for a convex hull problem
- A spectral algorithm for latent Dirichlet allocation
- A procedure of Chvátal for testing feasibility in linear programming and matrix scaling
- Extensions of Lipschitz mappings into a Hilbert space
- Polynomial algorithms in linear programming
- The quickhull algorithm for convex hulls
- Sparse Approximation via Generating Point Sets
- 10.1162/jmlr.2003.3.4-5.993
- Sequential greedy approximation for certain convex optimization problems
- Coresets for polytope distance
- Computing a nonnegative matrix factorization -- provably
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
This page was built for publication: Robust vertex enumeration for convex hulls in high dimensions
