An algorithmic separating hyperplane theorem and its applications

DOI10.1016/j.dam.2018.05.009zbMath1436.90138arXiv1412.0356OpenAlexW2963036993MaRDI QIDQ1728094

Bahman Kalantari

Publication date: 21 February 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingquadratic programmingdualityconvex setsconvex hullsupport vector machinesapproximation algorithmsseparating hyperplane theoremFrank-WolfeGilbert's algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (4)

Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries ⋮ QuickhullDisk: a faster convex hull algorithm for disks ⋮ A characterization theorem and an algorithm for a convex hull problem ⋮ First-order methods for the convex hull membership problem

Cites Work

• A new polynomial-time algorithm for linear programming
• A characterization theorem and an algorithm for a convex hull problem
• A procedure of Chvátal for testing feasibility in linear programming and matrix scaling
• Diagonal Matrix Scaling and Linear Programming
• Sequential greedy approximation for certain convex optimization problems
• Coresets for polytope distance
• Estimation of Dependences Based on Empirical Data
• An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithmic separating hyperplane theorem and its applications