International audienceIn this paper we determine the proximity functions of the sum and the maximum of componentwise (reciprocal) quotients of positive vectors. For the sum of quotients, denoted by $Q_1$, the proximity function is just a componentwise shrinkage function which we call q-shrinkage. This is similar to the proximity function of the ℓ1-norm which is given by componentwise soft shrinkage. For the maximum of quotients $Q_∞$, the proximal function can be computed by first order primal dual methods involving epigraphical projections. The proximity functions of $Q_ν$ , $ν = 1,∞$ are applied to solve convex problems of the form $argmin_x Q _ν ( Ax/b )$ subject to $x ≥ 0$, $1^\top x ≤ 1$. Such problems are of interest in selectivity es...
Proximal methods are an important class of algorithms for solving nonsmooth, constrained, large-scal...
International audienceThe proximity operator of a convex function is a natural extension of the noti...
We introduce the q-paranorm, investigate some of its properties. We further give an algorithm which ...
International audienceIn this paper we determine the proximity functions of the sum and the maximum ...
In this paper we determine the proximity functions of the sum and the maximum of componentwise (reci...
In this paper we determine the proximity functions of the sum and the maximum of componentwise (reci...
International audienceWhile ϕ-divergences have been extensively studied in convex analysis, their us...
While phi-divergences have been extensively studied in convex analysis, their use in optimization pr...
We examine the best approximation of componentwise positive vectors or pos-itive continuous function...
International audienceA new result in convex analysis on the calculation of proximity operators in c...
AbstractWe examine the best approximation of componentwise positive vectors or positive continuous f...
International audienceConvex optimization problems involving information measures have been extensiv...
A new result in convex analysis on the calculation of proximity operators in certain scaled norms is...
International audienceThe Douglas-Rachford algorithm is a popular iterative method for finding a zer...
Proximal methods are an important class of algorithms for solving nonsmooth, constrained, large-scal...
International audienceThe proximity operator of a convex function is a natural extension of the noti...
We introduce the q-paranorm, investigate some of its properties. We further give an algorithm which ...
International audienceIn this paper we determine the proximity functions of the sum and the maximum ...
In this paper we determine the proximity functions of the sum and the maximum of componentwise (reci...
In this paper we determine the proximity functions of the sum and the maximum of componentwise (reci...
International audienceWhile ϕ-divergences have been extensively studied in convex analysis, their us...
While phi-divergences have been extensively studied in convex analysis, their use in optimization pr...
We examine the best approximation of componentwise positive vectors or pos-itive continuous function...
International audienceA new result in convex analysis on the calculation of proximity operators in c...
AbstractWe examine the best approximation of componentwise positive vectors or positive continuous f...
International audienceConvex optimization problems involving information measures have been extensiv...
A new result in convex analysis on the calculation of proximity operators in certain scaled norms is...
International audienceThe Douglas-Rachford algorithm is a popular iterative method for finding a zer...
Proximal methods are an important class of algorithms for solving nonsmooth, constrained, large-scal...
International audienceThe proximity operator of a convex function is a natural extension of the noti...
We introduce the q-paranorm, investigate some of its properties. We further give an algorithm which ...