Related papers: Prox-regular sweeping processes with bounded retra…
In this paper, we study the proximal gradient algorithm with extrapolation for minimizing the sum of a Lipschitz differentiable function and a proper closed convex function. Under the error bound condition used in [19] for analyzing the…
This paper concerns optimal control problems for a class of sweeping processes governed by discontinuous unbounded differential inclusions that are described via normal cone mappings to controlled moving sets. Largely motivated by…
We derive regularity estimates for viscosity solutions to the parabolic normalized p-Laplace. By using approximation methods and scaling arguments for the normalized p-parabolic operator, we show that the gradient of bounded viscosity…
We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins-Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to…
We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins-Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to…
We consider the problem of learning an inner approximation of the region of attraction (ROA) of an asymptotically stable equilibrium point without an explicit model of the dynamics. Rather than leveraging approximate models with bounded…
The sweeping process was proposed by J. J. Moreau as a general mathematical formalism for quasistatic processes in elastoplastic bodies. This formalism deals with connected Prandtl's elastic-ideal plastic springs, which can form a system…
For the composite multi-objective optimization problem composed of two nonsmooth terms, a smoothing method is used to overcome the nonsmoothness of the objective function, making the objective function contain at most one nonsmooth term.…
Rotational smoothing is a phenomenon consisting in a gain of regularity by means of averaging over rotations. This phenomenon is present in operators that regularize only in certain directions, in contrast to operators regularizing in all…
For nonconvex and nonsmooth restoration models, the lower bound theory reveals their good edge recovery ability, and related analysis can help to design convergent algorithms. Existing such discussions are focused on isotropic…
We investigate the continuous non-monotone DR-submodular maximization problem subject to a down-closed convex solvable constraint. Our first contribution is to construct an example to demonstrate that (first-order) stationary points can…
In this paper, we propose a primal-dual algorithm with a novel momentum term using the partial gradients of the coupling function that can be viewed as a generalization of the method proposed by Chambolle and Pock in 2016 to solve saddle…
Block-coordinate algorithms are recognized to furnish efficient iterative schemes for addressing large-scale problems, especially when the computation of full derivatives entails substantial memory requirements and computational efforts. In…
We propose a globally-accelerated, first-order method for the optimization of smooth and (strongly or not) geodesically-convex functions in a wide class of Hadamard manifolds. We achieve the same convergence rates as Nesterov's accelerated…
We consider a unique continuation problem where the Dirichlet trace of the solution is known to have finite dimension. We prove Lipschitz stability of the unique continuation problem and design a finite element method that exploits the…
We describe algorithms for finding the regression of t, a sequence of values, to the closest sequence s by mean squared error, so that s is always increasing (isotonicity) and so the values of two consecutive points do not increase by too…
We start presenting an $L^{\infty}$-gradient bound for solutions to non-homogeneous $p$-Laplacean type systems and equations, via suitable non-linear potentials of the right hand side. Such a bound implies a Lorentz space characterization…
This paper develops a general theory for first-order descent methods whose search directions are restricted to a prescribed dictionary in a reflexive Banach space. Instead of assuming that the linear span of the dictionary is dense, as in…
We study the optimal rectangular-discrepancy approximation of permutons by finite permutations. We transfer bounds from discrepancy theory to this more restricted setup. Moreover, we show that superlinear approximation can occur only for…
SDE driven by an $\alpha $-stable process, $\alpha \in \lbrack 1,2),$ with Lipshitz continuous coefficient and $\beta $-H\"older drift is considered. The existence and uniqueness of a strong solution is proved when $\beta >1-\alpha /2$ by…