# Capra-Convexity, Convex Factorization and Variational Formulations for the ℓ0 Pseudonorm

@article{Chancelier2020CapraConvexityCF, title={Capra-Convexity, Convex Factorization and Variational Formulations for the ℓ0 Pseudonorm}, author={Jean-Philippe Chancelier and Michel De Lara}, journal={Set-Valued and Variational Analysis}, year={2020}, volume={30}, pages={597-619} }

The so-called ℓ 0 pseudonorm, or cardinality function, counts the number of nonzero components of a vector. In this paper, we analyze the ℓ 0 pseudonorm by means of so-called Capra (constant along primal rays) conjugacies, for which the underlying source norm and its dual norm are both orthant-strictly monotonic (a notion that we formally introduce and that encompasses the ℓ p -norms, but for the extreme ones). We obtain three main results. First, we show that the ℓ 0 pseudonorm is equal to its…

## 7 Citations

### The Capra-subdifferential of the l0 pseudonorm

- Mathematics
- 2021

The (cid:96) 0 pseudonorm counts the nonzero coordinates of a vector. It is often used in optimization problems to enforce the sparsity of the solution. However, this function is nonconvex and…

### Orthant-Strictly Monotonic Norms, Generalized Top-k and k-Support Norms and the L0 Pseudonorm

- Mathematics
- 2020

The so-called ℓ 0 pseudonorm on the Euclidean space R d counts the number of nonzero components of a vector. We say that a sequence of norms is strictly increasingly graded (with respect to the ℓ 0…

### OSCAR: Optimal subset cardinality regression using the L0-pseudonorm with applications to prognostic modelling of prostate cancer

- Computer SciencebioRxiv
- 2022

A novel methodology using the L0-pseudonorm, also known as the best subset selection, which has largely gone overlooked due to its challenging discrete nature is presented, and makes use of a continuous transformation of the discrete optimization problem, and provides effective solvers implemented in a user friendly R software package.

### Fe b 20 22 THE TROPICAL ANALOGUES OF REPRODUCING KERNELS

- Mathematics
- 2022

Hilbertian kernel methods and their positive semidefinite kernels have known an extensive use in various fields of applied mathematics and machine learning, owing to their several equivalent…

### Tropical reproducing kernels and optimization

- Mathematics
- 2022

. Hilbertian kernel methods and their positive semideﬁnite kernels have been extensively used in various ﬁelds of applied mathematics and machine learning, owing to their several equivalent…

### Rank-Based Norms, Capra-Conjugacies and the Rank Function

- Mathematics, Computer Science
- 2021

The Capra conjugate and biconjugate of the rank function are computed in function of a sequence of rank-based norms, more precisely generalized r-rank and dual r- rank matrix norms associated with the matrix source norm.

## References

SHOWING 1-10 OF 29 REFERENCES

### Atomic Decomposition via Polar Alignment

- Computer Science
- 2020

Polar Alignment plays a special role in a simple and geometric form of convex duality correspondence that yields a general notion of alignment that leads to an intuitive and complete description of how atoms participate in the final decomposition of the solution.

### Atomic Decomposition via Polar Alignment: The Geometry of Structured Optimization

- Computer ScienceFound. Trends Optim.
- 2020

### Constant along primal rays conjugacies and the l 0 pseudonorm

- Mathematics, Computer ScienceOptimization
- 2020

This paper provides a new family of lower bounds for the pseudonorm, as a fraction between two norms, the denominator being any norm.

### Hidden Convexity in the l0 Pseudonorm

- Mathematics
- 2020

The so-called l0 pseudonorm counts the number of nonzero components of a vector of a Euclidian space.
It is well-known that the l0 pseudonorm is not convex, as its Fenchel biconjugate is zero.
In…

### A unified perspective on convex structured sparsity: Hierarchical, symmetric, submodular norms and beyond

- Computer Science, Mathematics
- 2016

A unified theory for convex structured sparsity-inducing norms on vectors associated with combinatorial penalty functions, which leads to general efficient algorithms for all these norms, recovering as special cases several algorithms proposed in the literature and yielding improved procedures for some cases.