相关论文: On the gradient rearrangement of functions
In this paper, we introduce a symmetrization technique for the distributional gradient of a function of bounded variation in the anisotropic setting. This generalizes the result obtained in the Euclidean case in…
In a complete metric space that is equipped with a doubling measure and supports a Poincar\'e inequality, we show that functions of bounded variation (BV functions) can be approximated in the strict sense and pointwise uniformly by special…
This paper extends the result of \cite{BM} on the homogenization of integral functionals with linear growth defined for Sobolev maps taking values in a given manifold. Through a $\Gamma$-convergence analysis, we identify the homogenized…
In this paper we prove several formulae that enable one to capture the singular portion of the measure derivative of a function of bounded variation as a limit of non-local functionals. One special case shows that rescalings of the…
A symmetric function of $N$ variables can be given in terms of symmetric polynomials of these variables. We determine those symmetric polynomials in which the dual differential operators take the neatest form when expressed in terms of our…
This work presents a study of perturbations of symmetric Boolean functions. In particular, it establishes a connection between exponential sums of these perturbations and Diophantine equations of the form $$ \sum_{l=0}^n \binom{n}{l}…
The self-concordant-like property of a smooth convex function is a new analytical structure that generalizes the self-concordant notion. While a wide variety of important applications feature the self-concordant-like property, this concept…
We extend the classical Lebesgue and Fubini differentiation theorems to functions of several variables, using the notions of joint derivative and joint monotonicity. Our first main result shows that for a function $f$ of bounded variation,…
Bilevel programming has recently received a great deal of attention due to its abundant applications in many areas. The optimal value function approach provides a useful reformulation of the bilevel problem, but its utility is often limited…
We study gradient methods for optimizing $(L_0, L_1)$-smooth functions, a class that generalizes Lipschitz-smooth functions and has gained attention for its relevance in machine learning. We provide new insights into the structure of this…
We introduce function spaces for the treatment of non-linear parabolic equations with variable $\log$-H\"older continuous exponents, which only incorporate information of the symmetric part of a gradient. As an analogue of Korn's inequality…
In this paper, we provide a generalization of the forward-backward splitting algorithm for minimizing the sum of a proper convex lower semicontinuous function and a differentiable convex function whose gradient satisfies a locally…
We study the slicing and fine properties of functions in $\mathrm{BV}^{\mathcal A}$, the space of functions with bounded $\mathcal A$-variation. Here, $\mathcal A$ is a homogeneous linear differential operator with constant coefficients (of…
In this paper we propose a distributed version of a randomized block-coordinate descent method for minimizing the sum of a partially separable smooth convex function and a fully separable non-smooth convex function. Under the assumption of…
We investigate the computation of the gradient of the value function in parametric convex optimization problems. We derive general expression for the gradient of the value function in terms of the cost function, constraints and Lagrange…
In this paper, we study the convergence rate of the gradient (or steepest descent) method with fixed step lengths for finding a stationary point of an $L$-smooth function. We establish a new convergence rate, and show that the bound may be…
This paper is devoted to investigating the sequence of some linear functionals in the space $BV$ of finite variation functions. We prove that under certain conditions this sequence is bounded. We also prove that this result is sharp. In…
We analyze the constant step size subgradient method on nonsmooth, nonconvex functions. We identify geometric assumptions on the objective function under which i) its domain admits a partition (stratification) into smooth manifolds (strata)…
We propose to differentiate a general curvature functional with two different approaches. In the first one we compute the derivative with the tools of shape optimization and in the second one we compute the derivative of a volumic…
We prove a Leibniz rule for BV functions in a complete metric space that is equipped with a doubling measure and supports a Poincar\'e inequality. Unlike in previous versions of the rule, we do not assume the functions to be locally…