Optimal scaling of balls and polyhedra

DOI10.1007/BF01583784zbMath0479.90064MaRDI QIDQ3938841

Robert M. Freund, B. Curtis Eaves

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

convex quadratic programmingoptimal scalingcellsoptimal containmentclosed polyhedral convex setclosed solid balllinear quadratic programmingmeet problems

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20) Linear programming (90C05) Polytopes and polyhedra (52Bxx)

Related Items (10)

On the complexity of four polyhedral set containment problems ⋮ Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces ⋮ Quadratic problems defined on a convex hull of points ⋮ SHARPENING GEOMETRIC INEQUALITIES USING COMPUTABLE SYMMETRY MEASURES ⋮ Inner and outer approximations of polytopes using boxes. ⋮ On the symmetry function of a convex set ⋮ Minimal containment under homothetics: a simple cutting plane approach ⋮ Strong IP formulations need large coefficients ⋮ Uniqueness of circumcenters in generalized Minkowski spaces ⋮ Algorithms for the solution of quadratic knapsack problems

Cites Work

• Flexible solutions to systems of linear inequalities
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• The simplicial approximation approach to design centering
• The Minimum Covering Sphere Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal scaling of balls and polyhedra