On the Minimum Volume Covering Ellipsoid of Ellipsoids
From MaRDI portal
Publication:5757342
DOI10.1137/050622560zbMATH Open1128.90048OpenAlexW2012819062MaRDI QIDQ5757342FDOQ5757342
Authors: E. Alper Yildirim
Publication date: 6 September 2007
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/23637
Recommendations
- Minimum-volume enclosing ellipsoids and core sets
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Computing minimum-volume enclosing axis-aligned ellipsoids
- Computation of Minimum-Volume Covering Ellipsoids
- Rounding of Polytopes in the Real Number Model of Computation
approximation algorithmscore setsLöwner ellipsoidsminimum volume covering ellipsoidsrounding of convex sets
Numerical mathematical programming methods (65K05) Convex programming (90C25) Semidefinite programming (90C22)
Cited In (25)
- Edge detection by spherical separation
- ELLIPSOIDS ARE THE ONLY LOCAL MAXIMIZERS OF THE VOLUME PRODUCT
- Computation of Minimum-Volume Covering Ellipsoids
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
- Title not available (Why is that?)
- Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming
- Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier
- An algorithm for the parametric search of elliptic I- and S-hulls of a convex compactum
- Uniform distributions and random variate generation over generalized \(l_p\) balls and spheres
- Title not available (Why is that?)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
- Minimum-volume enclosing ellipsoids and core sets
- Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Analysis of an open foam generated from computerized tomography scans of physical foam samples
- Computing minimum-volume enclosing axis-aligned ellipsoids
- Ellipsoidal approximations of convex sets based on the volumetric barrier
- A preliminary set of applications leading to stochastic semidefinite programs and chance-constrained semidefinite programs
- A computationally inexpensive algorithm for determining outer and inner enclosures of nonlinear mappings of ellipsoidal domains
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
- A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids
- Rounding of Polytopes in the Real Number Model of Computation
- Solving \(k\)-center problems involving sets based on optimization techniques
This page was built for publication: On the Minimum Volume Covering Ellipsoid of Ellipsoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757342)