On the Minimum Volume Covering Ellipsoid of Ellipsoids

From MaRDI portal
Publication:5757342

DOI10.1137/050622560zbMath1128.90048OpenAlexW2012819062MaRDI QIDQ5757342

E. Alper Yıldırım

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




Related Items (16)

The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problemsFinding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive ProgrammingAnalysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrierAnalysis of an open foam generated from computerized tomography scans of physical foam samplesA Filtering Heuristic for the Computation of Minimum-Volume Enclosing EllipsoidsRelatively Smooth Convex Optimization by First-Order Methods, and ApplicationsEnclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimizationScandinavian thins on top of cake: new and improved algorithms for stacking and packingComputing minimum-volume enclosing axis-aligned ellipsoidsA preliminary set of applications leading to stochastic semidefinite programs and chance-constrained semidefinite programsSymmetry of convex sets and its applications to the extremal ellipsoids of convex bodiesSolving \(k\)-center problems involving sets based on optimization techniquesA computationally inexpensive algorithm for determining outer and inner enclosures of nonlinear mappings of ellipsoidal domainsAPPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNINGUniform distributions and random variate generation over generalized \(l_p\) balls and spheresEdge detection by spherical separation




This page was built for publication: On the Minimum Volume Covering Ellipsoid of Ellipsoids