English
Related papers

Related papers: What are Capra-Convex Sets?

200 papers

The support of a vector in R d is the set of indices with nonzero entries. Functions of the support have the property to be 0-homogeneous and, because of that, the Fenchel conjugacy fails to provide relevant analysis. In this paper, we…

Optimization and Control · Mathematics 2020-10-27 Jean-Philippe Chancelier , Michel de Lara

The l0 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 noncontinuous, and optimization problems formulated…

Optimization and Control · Mathematics 2022-08-19 Adrien Le Franc , Jean-Philippe Chancelier , Michel de Lara

The so-called l0 pseudonorm, or cardinality function, counts the number of nonzero components of a vector. In this paper, we analyze the l0 pseudonorm by means of so-called Capra (constant along primal rays) conjugacies, for which the…

Optimization and Control · Mathematics 2021-08-09 Jean-Philippe Chancelier , Michel de Lara

The so-called l0 pseudonorm on Rd counts the number of nonzero components of a vector. It is used in sparse optimization, either as criterion or in the constraints, to obtain solutions with few nonzero entries. For such problems, the…

Optimization and Control · Mathematics 2021-06-02 Jean-Philippe Chancelier , Michel de Lara

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 this paper, we introduce a suitable…

Optimization and Control · Mathematics 2021-06-18 Jean-Philippe Chancelier , Michel de Lara

The so-called l0 pseudonorm on R d counts the number of nonzero components of a vector. It is well-known that the l0 pseudonorm is not convex, as its Fenchel biconjugate is zero. In this paper, we introduce a suitable conjugacy, induced by…

Optimization and Control · Mathematics 2019-02-14 Jean-Philippe Chancelier , Michel De Lara , Ponts Paristech

The (delta-) normal cone to an arbitrary intersection of sublevel sets of proper, lower semicontinuous, and convex functions is characterized, using either epsilon-subdifferentials at the nominal point or exact subdifferentials at nearby…

Optimization and Control · Mathematics 2017-10-30 Abderrahim Hantoute , Anton Svensson

We consider the space of matrices, with given number of rows and of columns, equipped with the classic trace scalar product. With any matrix (source) norm, we associate a coupling, called Capra, between the space of matrices and itself.…

Optimization and Control · Mathematics 2023-02-07 Paul Barbier , Jean-Philippe Chancelier , Michel de Lara , Valentin Paravy

We develop techniques to convexify a set that is invariant under permutation and/or change of sign of variables and discuss applications of these results. First, we convexify the intersection of the unit ball of a permutation and…

Optimization and Control · Mathematics 2021-08-10 Jinhak Kim , Mohit Tawarmalani , Jean-Philippe P. Richard

To a function with values in the power set of a pre-ordered, separated locally convex space a family of scalarizations is given which completely characterizes the original function. A concept of a Legendre-Fenchel conjugate for set-valued…

Optimization and Control · Mathematics 2014-05-29 Carola Schrage

We provide sharp and explicit characterizations of the normal cone to sublevel sets of suprema of arbitrary functions, expressed exclusively in terms of subdifferentials of the data functions. In the convex case, the resulting formulas…

Optimization and Control · Mathematics 2026-02-12 Stephanie Caro , Rafael Correa , Abderrahim Hantoute

Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…

Combinatorics · Mathematics 2024-02-14 Balázs Keszegh

The classical concept of Fenchel conjugation is tailored to extended real-valued functions defined on linear spaces. In this paper we generalize this concept to functions defined on arbitrary sets that do not necessarily bear any structure…

Functional Analysis · Mathematics 2024-09-11 Anton Schiela , Roland Herzog , Ronny Bergmann

A coupling-constant definition is given based on the compositeness property of some particle states with respect to the elementary states of other particles. It is applied in the context of the vector-spin-1/2-particle interaction vertices…

High Energy Physics - Phenomenology · Physics 2009-11-10 J. Besprosvany

In this paper, Kernel PCA is reinterpreted as the solution to a convex optimization problem. Actually, there is a constrained convex problem for each principal component, so that the constraints guarantee that the principal component is…

Machine Learning · Computer Science 2017-10-25 Carlos M. Alaíz , Michaël Fanuel , Johan A. K. Suykens

If the complement of a closed convex set in a closed convex cone is bounded, then this complement minus the apex of the cone is called a coconvex set. Coconvex sets appear in singularity theory (they are closely related to Newton diagrams)…

Metric Geometry · Mathematics 2013-12-04 Askold Khovanskii , Vladlen Timorin

In this note we show that a connected, closed and locally convex subset (with an extra assumption on the diameter with respect to the induced length metric if $\kappa>0$) of a $CAT(\kappa)$ space is convex.

Metric Geometry · Mathematics 2013-05-08 Carlos Ramos-Cuevas

Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…

Optimization and Control · Mathematics 2025-01-30 Reinier Diàz Millàn , Nadezda Sukhorukova , Julien Ugon

The class of $\mu$-compact sets can be considered as a natural extension of the class of compact metrizable subsets of locally convex spaces, to which the particular results well known for compact sets can be generalized. This class…

Functional Analysis · Mathematics 2010-04-23 M. E. Shirokov

We consider a sub-class of the $f$-divergences satisfying a stronger convexity property, which we refer to as strongly convex, or $\kappa$-convex divergences. We derive new and old relationships, based on convexity arguments, between…

Information Theory · Computer Science 2020-12-30 James Melbourne
‹ Prev 1 2 3 10 Next ›