The following pages link to Minimum-Volume Ellipsoids (Q2825979):
Displaying 16 items.
- Parallel processing of the Build Hull algorithm to address the large-scale DEA problem (Q827294) (← links)
- On greedy heuristics for computing D-efficient saturated subsets (Q1984679) (← links)
- Dual optimal design and the Christoffel-Darboux polynomial (Q1996729) (← links)
- Computing minimum-volume enclosing ellipsoids for large datasets (Q2129596) (← links)
- Nonlinear set membership filter with state estimation constraints via consensus-ADMM (Q2681381) (← links)
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857) (← links)
- Optimal Data Fitting: A Moment Approach (Q4555461) (← links)
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications (Q4603043) (← links)
- On the elimination of inessential points in the smallest enclosing ball problem (Q4622883) (← links)
- Approximating Nonnegative Polynomials via Spectral Sparsification (Q4629345) (← links)
- Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming (Q5058050) (← links)
- Fenchel Duality and a Separation Theorem on Hadamard Manifolds (Q5080506) (← links)
- Computing minimum-volume enclosing ellipsoids (Q6062882) (← links)
- First-order methods for convex optimization (Q6169988) (← links)
- Mixed-integer linear programming for computing optimal experimental designs (Q6616196) (← links)
- The polytope of optimal approximate designs: extending the selection of informative experiments (Q6657821) (← links)
