Randomized algorithms for the separation of point sets and for solving quadratic programs

DOI10.1007/BF01185230zbMath0835.90062OpenAlexW1978674652MaRDI QIDQ1895800

Nikolai D. Botkin

Publication date: 13 August 1995

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01185230

zbMATH Keywords

randomized algorithmlinearly constrained general convex quadratic problemsseparating algorithm

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Quadratic programming (90C20) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Generation of dangerous disturbances for flight systems

Cites Work

• A numerically stable dual method for solving strictly convex quadratic programs
• Small-dimensional linear programming and convex hulls made easy

This page was built for publication: Randomized algorithms for the separation of point sets and for solving quadratic programs