Pages that link to "Item:Q2825979"
From MaRDI portal
The following pages link to Minimum-volume ellipsoids. Theory and algorithms (Q2825979):
Displaying 31 items.
- Minimum-volume ellipsoidal approximation of the sum of two ellipsoids (Q464993) (← links)
- Conditional minimum volume ellipsoid with application to multiclass discrimination (Q732238) (← links)
- Parallel processing of the Build Hull algorithm to address the large-scale DEA problem (Q827294) (← links)
- Minimum-volume ellipsoids containing compact sets: Application to parameter bounding (Q1345621) (← links)
- On equivalence of major relaxation methods for minimum ellipsoid covering intersection of ellipsoids (Q1737845) (← links)
- Derivation of multi-dimensional ellipsoid convex model for experimental data (Q1816644) (← links)
- Algorithms to construct a minimum-volume invariant ellipsoid for a stable dynamic system (Q1918744) (← links)
- A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms (Q1941215) (← 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)
- 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)
- An algorithm for constructing of minimal volume ellipsoid (Q2739958) (← links)
- Various modifications of optimum algorithm of construction of the minimal area ellipse (Q2745052) (← 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)
- 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)
- (Q4892209) (← links)
- (Q4952659) (← links)
- Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming (Q5058050) (← links)
- Fenchel Duality and a Separation Theorem on Hadamard Manifolds (Q5080506) (← links)
- Computation of Minimum-Volume Covering Ellipsoids (Q5321988) (← 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)