Pages that link to "Item:Q2481119"
From MaRDI portal
The following pages link to Computing minimum-volume enclosing axis-aligned ellipsoids (Q2481119):
Displaying 18 items.
- Exact primitives for smallest enclosing ellipses (Q293400) (← links)
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem (Q434159) (← links)
- Minimum-volume enclosing ellipsoids and core sets (Q813369) (← links)
- Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem (Q968187) (← links)
- A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms (Q1941215) (← links)
- From approximate balls to approximate ellipses (Q1955552) (← links)
- Computing a minimum-width cubic and hypercubic shell (Q2294346) (← links)
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) (← links)
- Clustering via minimum volume ellipsoids (Q2385541) (← links)
- Quantile approximation for robust statistical estimation and \(k\)-enclosing problems (Q2708040) (← links)
- An algorithm for constructing of minimal volume ellipsoid (Q2739958) (← links)
- Minimum-volume ellipsoids. Theory and algorithms (Q2825979) (← links)
- A linearly convergent algorithm for solving the minimum volume axis-aligned ellipsoid problem (Q2885944) (← links)
- A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids (Q2958363) (← links)
- An active-set algorithm for solving the minimum volume enclosing ellipsoid problems (Q3195781) (← links)
- Computation of Minimum-Volume Covering Ellipsoids (Q5321988) (← links)
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids (Q5459815) (← links)
- Computing minimum-volume enclosing ellipsoids (Q6062882) (← links)
