Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries

DOI10.1145/3516520MaRDI QIDQ5883715zbMATH OpenOpenAlexWikidataFDO

Authors Bahman Kalantari, Yikai Zhang

Publication date 22 March 2023

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3516520

zbMATH Keywords

convex hull membershipdata reductionmachine learningminimum enclosing balltriangle algorithm

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• A characterization theorem and an algorithm for a convex hull problem
• Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
• An algorithmic separating hyperplane theorem and its applications
• An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
• Approximate clustering via core-sets
• Approximate minimum enclosing balls in high dimensions using core-sets
• Computation of Minimum-Volume Covering Ellipsoids
• Coresets for polytope distance
• Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
• Covering spheres with spheres
• Diagonal Matrix Scaling and Linear Programming
• Geometric algorithms and combinatorial optimization.
• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 566419 (Why is no real title available?)
• scientific article; zbMATH DE number 2079414 (Why is no real title available?)
• scientific article; zbMATH DE number 2117213 (Why is no real title available?)
• scientific article; zbMATH DE number 6776481 (Why is no real title available?)
• On the spherical surface of smallest radius enclosing a bounded subset of 𝑛-dimensional euclidean space
• Optimal core-sets for balls
• Polynomial algorithms in linear programming
• Robust vertex enumeration for convex hulls in high dimensions
• Smooth minimization of non-smooth functions
• Sparse approximation via generating point sets
• The domination heuristic for LP-type problems
• The quickhull algorithm for convex hulls
• Two Algorithms for the Minimum Enclosing Ball Problem

Cited in

(4)

• First-order methods for the convex hull membership problem
• Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
• Algorithm 1024
• A method based on linear feasibility tests for full-rank characterization of convex combinations of matrices

Describes a project that uses

Uses Software

• Qhull

This page was built for publication: Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries

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