Pages that link to "Item:Q813369"
From MaRDI portal
The following pages link to Minimum-volume enclosing ellipsoids and core sets (Q813369):
Displayed 34 items.
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem (Q434159) (← links)
- An algebraic approach to continuous collision detection for ellipsoids (Q543838) (← links)
- Estimation and asymptotics for buffered probability of exceedance (Q723976) (← links)
- Uniqueness results for minimal enclosing ellipsoids (Q735538) (← links)
- Fast subspace approximation via greedy least-squares (Q745854) (← links)
- Using enclosing ellipsoids in multiaxial fatigue strength criteria (Q817510) (← links)
- Non-probabilistic polygonal convex set model for structural uncertainty quantification (Q822073) (← links)
- Developments in differential game theory and numerical methods: Economic and management applications (Q926557) (← links)
- Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem (Q968187) (← links)
- Practical methods for shape fitting and kinetic data structures using coresets (Q1006384) (← links)
- Quadrangulation of non-rigid objects using deformation metrics (Q1644347) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- On greedy heuristics for computing D-efficient saturated subsets (Q1984679) (← links)
- Convex programming based spectral clustering (Q2051294) (← links)
- A branch-and-bound algorithm for the exact optimal experimental design problem (Q2058883) (← links)
- Computing minimum-volume enclosing ellipsoids for large datasets (Q2129596) (← links)
- Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem (Q2301135) (← links)
- Streaming algorithms for extent problems in high dimensions (Q2345940) (← links)
- Fast algorithms for the minimum volume estimator (Q2349524) (← links)
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) (← links)
- Clustering via minimum volume ellipsoids (Q2385541) (← links)
- Local generalized quadratic distance metrics: application to the \(k\)-nearest neighbors classifier (Q2418363) (← links)
- Computing minimum-volume enclosing axis-aligned ellipsoids (Q2481119) (← links)
- A credible interval analysis method for uncertain structures under nonprobabilistic framework (Q2678549) (← links)
- The Geometry of Differential Privacy: The Small Database and Approximate Cases (Q2805515) (← links)
- A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids (Q2958363) (← links)
- Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization (Q5252582) (← links)
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids (Q5459815) (← links)
- Rounding of convex sets and efficient gradient methods for linear programming problems (Q5459820) (← links)
- Analysis of incomplete data and an intrinsic-dimension Helly theorem (Q5901492) (← links)
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach (Q5963815) (← links)
- Sets that maximize probability and a related variational problem (Q6059519) (← links)
- Computing minimum-volume enclosing ellipsoids (Q6062882) (← links)
- Optimal Embedded and Enclosing Isosceles Triangles (Q6066459) (← links)