An efficient, exact, and generic quadratic programming solver for geometric optimization

DOI10.1145/336154.336191zbMath1377.68277MaRDI QIDQ5361521

Sven Schönherr, Bernd Gärtner

Publication date: 29 September 2017

Published in: Proceedings of the sixteenth annual symposium on Computational geometry (Search for Journal in Brave)

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

Mathematics Subject Classification ID

90C20: Quadratic programming

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

Approximate minimum enclosing balls in high dimensions using core-sets, A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\), A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\), Penalty-based aggregation of multidimensional data, On the string consensus problem and the Manhattan sequence consensus problem, A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\), A branch-and-bound method for the minimum \(k\)-enclosing ball problem, Using machine learning for model benchmarking and forecasting of depletion-induced seismicity in the Groningen gas field, Solving quadratic programs to high precision using scaled iterative refinement, Fast estimation of the shear stress amplitude for fatigue life analysis of metals, Integration of expert knowledge into radial basis function surrogate models, An efficient algorithm for the smallest enclosing ball problem in high dimensions, An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions

Uses Software

• CGAL