An efficient, exact, and generic quadratic programming solver for geometric optimization
From MaRDI portal
Publication:5361521
DOI10.1145/336154.336191zbMath1377.68277OpenAlexW2040103897MaRDI QIDQ5361521
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
Quadratic programming (90C20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (14)
Integration of expert knowledge into radial basis function surrogate models ⋮ An efficient algorithm for the smallest enclosing ball problem in high dimensions ⋮ A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) ⋮ A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) ⋮ An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions ⋮ A branch-and-bound method for the minimum \(k\)-enclosing ball problem ⋮ A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\) ⋮ Penalty-based aggregation of multidimensional data ⋮ On the string consensus problem and the Manhattan sequence consensus problem ⋮ Exact QR factorizations of rectangular matrices ⋮ 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 ⋮ Approximate minimum enclosing balls in high dimensions using core-sets ⋮ Fast estimation of the shear stress amplitude for fatigue life analysis of metals
Uses Software
This page was built for publication: An efficient, exact, and generic quadratic programming solver for geometric optimization
