Polytopal balls arising in optimization
From MaRDI portal
Abstract: We study a family of polytopes and their duals, that appear in various optimization problems as the unit balls for certain norms. These two families interpolate between the hypercube, the unit ball for the -norm, and its dual cross-polytope, the unit ball for the -norm. We give combinatorial and geometric properties of both families of polytopes such as their -vector, their volume, and the volume of their boundary.
Recommendations
- Deforming \(\|.\|_1\) into \(\|.\|_{\infty}\) via polyhedral norms: a pedestrian approach
- Explicit Solutions to Optimization Problems on the Intersections of the Unit Ball of the $l_1 $ and $l_\infty $ Norms with a Hyperplane
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization
- A note on approximation of a ball by polytopes
- Convex optimization and parsimony of L_p-balls representation
Cites work
- A remark on the Mahler conjecture: local minimality of the unit cube
- Cube Slicing in R n
- CVaR norm and applications in optimization
- DC formulations and algorithms for sparse optimization problems
- Feature selection in SVM via polyhedral \(k\)-norm
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 3559582 (Why is no real title available?)
- scientific article; zbMATH DE number 3048077 (Why is no real title available?)
- Hyperplane Sections of the <em>n</em>-Dimensional Cube
- Linear best approximation using a class of polyhedral norms
- Min-up/min-down polytopes
- On the Moreau-Yosida regularization of the vector k-norm related functions
- Parallelohedra: a retrospective and new results
- Robust linear optimization under general norms.
- Spline Notation Applied to a Volume Problem
- Statistical Inference via Convex Optimization
- Symmetric Mahler's conjecture for the volume product in the \(3\)-dimensional case
- The number of faces of centrally-symmetric polytopes
- Triangulations. Structures for algorithms and applications
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization
Cited in
(7)- Polytopes related to the \(l_{\infty}\)-distance between vectors
- Maximizing the sum of radii of balls inscribed in a polyhedral set
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization
- Explicit Solutions to Optimization Problems on the Intersections of the Unit Ball of the $l_1 $ and $l_\infty $ Norms with a Hyperplane
- Deforming \(\|.\|_1\) into \(\|.\|_{\infty}\) via polyhedral norms: a pedestrian approach
- Convex optimization and parsimony of L_p-balls representation
- Shallow sections of the hypercube
This page was built for publication: Polytopal balls arising in optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391332)
