Related papers: Relative Lipschitz-like property of parametric sys…
We prove the Sobolev-to-Lipschitz property for metric measure spaces satisfying the quasi curvature dimension condition recently introduced in E. Milman, The Quasi Curvature-Dimension Condition with applications to sub-Riemannian manifolds,…
We show that the augmented primal-dual gradient algorithms can achieve global exponential convergence with partially strongly convex functions. In particular, the objective function only needs to be strongly convex in the subspace…
The full history recursive multilevel Picard approximation method for semilinear parabolic partial differential equations (PDEs) is the only method which provably overcomes the curse of dimensionality for general time horizons if the…
Abstracting neural networks with constraints they impose on their inputs and outputs can be very useful in the analysis of neural network classifiers and to derive optimization-based algorithms for certification of stability and robustness…
A version of the fundamental mean-square convergence theorem is proved for stochastic differential equations (SDE) which coefficients are allowed to grow polynomially at infinity and which satisfy a one-sided Lipschitz condition. The…
We give the first approximation algorithm for mixed packing and covering semidefinite programs (SDPs) with polylogarithmic dependence on width. Mixed packing and covering SDPs constitute a fundamental algorithmic primitive with recent…
We study the mean radius growth function for quasiconformal mappings. We give a new sub-class of quasiconformal mappings in $\mathbb{R}^n$, for $n\geq 2$, called bounded integrable parameterization mappings, or BIP maps for short. These…
The purpose of this article is to study Lipschitz CR mappings from an $h$-extendible (or semi-regular) hypersurface in $\mbb C^n$. Under various assumptions on the target hypersurface, it is shown that such mappings must be smooth. A…
We introduce the notion of conditional Lipschitz shadowing, which does not aim to shadow every pseudo-orbit, but only those which belong to a certain prescribed set. We establish two types of sufficient conditions under which certain…
We prove a version of the implicit function theorem for Lipschitz mappings $f:\mathbb{R}^{n+m}\supset A \to X$ into arbitrary metric spaces. As long as the pull-back of the Hausdorff content $\mathcal{H}_{\infty}^n$ by $f$ has positive…
We consider the problem of analyzing and designing gradient-based discrete-time optimization algorithms for a class of unconstrained optimization problems having strongly convex objective functions with Lipschitz continuous gradient. By…
We call the solution of a kind of second order homogeneous partial differential equation as real kernel alpha-harmonic mappings. In this paper, the representation theorem, the Lipschitz continuity, the univalency and the related problems of…
We study the local Lipschitz one subsets of a finite dimensional space, that is, sets for which there exists a continuous function whose local Lipschitz derivative is the characteristic function of said set. We give a characterization of a…
We study generalized quasiconformal mappings in the context of the inverse Poletsky inequality. We consider the local behavior and the boundary behavior of mappings with the inverse Poletsky inequality. In particular, we obtain logarithmic…
We introduce the Lipschitz matrix: a generalization of the scalar Lipschitz constant for functions with many inputs. Among the Lipschitz matrices compatible a particular function, we choose the smallest such matrix in the Frobenius norm to…
Quasi-projective dimension of modules over associative rings is generalized in this paper to the one of complexes of modules. Basic properties of this dimension are established, including a comparison result with projective dimension and a…
Some Hermite-Hadamard's mid-point type inequalities related to Katugampola fractional integrals are obtained where the first derivative of considered mappings is Lipschitzian or convex. Also some mid-point type inequalities are given for…
Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a…
This paper studies stability aspects of solutions of parametric mathematical programs and generalized equations, respectively, with disjunctive constraints. We present sufficient conditions that, under some constraint qualifications…
The classical Petty projection inequality is an affine isoperimetric inequality which constitutes a cornerstone in the affine geometry of convex bodies. By extending the polar projection body to an inter-dimensional operator, Petty's…