Minimal containment under homothetics: a simple cutting plane approach

DOI10.1007/S10589-009-9248-3MaRDI QIDQ535290zbMATH OpenOpenAlexFDO

Authors René Brandenberg, Lucia Roth

Publication date 11 May 2011

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-009-9248-3

zbMATH Keywords

convex optimizationcutting planescontainmentcore sets1-centerouter radius

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• No dimension independent core-sets for containment under homothetics
• On the complexity of some basic problems in computational convexity. I. Containment problems
• Multiple translational containment. I: An approximate algorithm
• No dimension-independent core-sets for containment under homothetics
• New Algorithms for k-Center and Extensions

Cites work

• scientific article; zbMATH DE number 3436238 (Why is no real title available?)
• scientific article; zbMATH DE number 2079414 (Why is no real title available?)
• scientific article; zbMATH DE number 236540 (Why is no real title available?)
• scientific article; zbMATH DE number 5019895 (Why is no real title available?)
• Algorithms - ESA 2003
• Approximate clustering via core-sets
• Approximate minimum enclosing balls in high dimensions using core-sets
• Circumspheres and Inner Products.
• Computational Science and Its Applications – ICCSA 2004
• Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
• Efficient algorithms for the smallest enclosing ball problem
• Geometric algorithms and combinatorial optimization.
• New algorithms for \(k\)-center and extensions
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• On the complexity of some basic problems in computational convexity. I. Containment problems
• Optimal scaling of balls and polyhedra
• Solving general continuous single facility location problems by cutting planes
• The 2-center problem with obstacles
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(8)

• No dimension independent core-sets for containment under homothetics
• Minkowski concentricity and complete simplices
• New Algorithms for k-Center and Extensions
• Diversities and the generalized circumradius
• Sharpening geometric inequalities using computable symmetry measures
• Uniqueness of circumcenters in generalized Minkowski spaces
• No dimension-independent core-sets for containment under homothetics
• New algorithms for \(k\)-center and extensions

Describes a project that uses

Uses Software

• SeDuMi
• CVX
• Miniball

This page was built for publication: Minimal containment under homothetics: a simple cutting plane approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535290)