Abstract
We consider, and study with elementary calculus, the polyhedral norms $||x||_{(k)}=$ sum of the $\mathit{k}$ largest among the $|x_{i}|$'s. Besides their basic properties, we provide various expressions of the unit balls associated with them and determine all the facets and vertices of these balls. We do the same with the dual norm $||.||_{(k)}^{\ast }$ of $||.||_{(k)}$. The study of these polyhedral norms is motivated, among other reasons, by the necessity of handling sparsity in some modern optimization problems, as is explained at the end of the paper.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
