Deforming \|.\|_1 into \|.\|_ via polyhedral norms: a pedestrian approach

DOI10.1137/21M1391481MaRDI QIDQ5094918zbMATH OpenOpenAlexFDO

Authors Manlio Gaudioso, Jean-Baptiste Hiriart-Urruty

Publication date 5 August 2022

Published in SIAM Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/21m1391481

zbMATH Keywords

dual normsfacets of polytopespolyhedral norms in \(\mathbb{R}^n\)polytopesunit balls of normsvertices of polytopes

Mathematics Subject Classification ID

Matrix completion problems (15A83) Convex functions and convex programs in convex geometry (52A41) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Recommendations

• Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization
• Polytopal balls arising in optimization
• Least sparsity of \(p\)-norm based optimization problems with \(p>1\)
• Convex optimization and parsimony of L_p-balls representation
• Explicit Solutions to Optimization Problems on the Intersections of the Unit Ball of the $l_1 $ and $l_\infty $ Norms with a Hyperplane

Cites work

• Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
• 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 3804333 (Why is no real title available?)
• Linear best approximation using a class of polyhedral norms
• Polytopal balls arising in optimization
• Sparse Solutions of Underdetermined Linear Systems and Their Applications

Cited in

(11)

• Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization
• Polytopal balls arising 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
• Exact regularization of polyhedral norms
• Extreme point inequalities and geometry of the rank sparsity ball
• Convex optimization and parsimony of L_p-balls representation
• Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
• Orthant-strictly monotonic norms, generalized top-k and k-support norms and the _0 pseudonorm
• Dual formulation of the sparsity constrained optimization problem: application to classification
• Difference of Convex programming in adversarial SVM
• A counting formula for extreme contractions on regular polygonal Banach spaces

This page was built for publication: Deforming \(\|.\|_1\) into \(\|.\|_{\infty}\) via polyhedral norms: a pedestrian approach

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