Pages that link to "Item:Q5361521"

The following pages link to An efficient, exact, and generic quadratic programming solver for geometric optimization (Q5361521):

Displaying 14 items.

• A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) (Q301399) (← links)
• A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) (Q833570) (← links)
• Penalty-based aggregation of multidimensional data (Q1697611) (← links)
• On the string consensus problem and the Manhattan sequence consensus problem (Q1698720) (← links)
• A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\) (Q1941021) (← links)
• A branch-and-bound method for the minimum \(k\)-enclosing ball problem (Q2157894) (← links)
• Using machine learning for model benchmarking and forecasting of depletion-induced seismicity in the Groningen gas field (Q2225387) (← links)
• Solving quadratic programs to high precision using scaled iterative refinement (Q2293654) (← links)
• Fast estimation of the shear stress amplitude for fatigue life analysis of metals (Q2301799) (← links)
• Integration of expert knowledge into radial basis function surrogate models (Q2358065) (← links)
• An efficient algorithm for the smallest enclosing ball problem in high dimensions (Q2369067) (← links)
• An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← links)
• Approximate minimum enclosing balls in high dimensions using core-sets (Q5463443) (← links)
• Exact QR factorizations of rectangular matrices (Q6204198) (← links)