Related papers: Gossez's skew linear map and its pathological maxi…
Many problems of theoretical and practical interest involve finding a convex or concave function. For instance, optimization problems such as finding the projection on the convex functions in $H^k(\Omega)$, or some problems in economics. In…
In this paper we introduce Hausdorff locally convex algebra topologies on subalgebras of the whole algebra of nonlinear generalized functions. These topologies are strong duals of Fr\'echet-Schwartz space topologies and even strong duals of…
We consider learning a convex combination of basis models, and present some new theoretical and empirical results that demonstrate the effectiveness of a greedy approach. Theoretically, we first consider whether we can use linear, instead…
Let $\gamma$ be an automorphism of a polarized complex projective manifold $(M,L)$. Then $\gamma$ induces an automorphism $\gamma_k$ of the space of global holomorphic sections of the $k$-th tensor power of $L$, for every $k=1,2,...$; for…
We prove non asymptotic polynomial bounds on the convergence of the Langevin Monte Carlo algorithm in the case where the potential is a convex function which is globally Lipschitz on its domain, typically the maximum of a finite number of…
Fedorchuk's fully closed (continuous) maps and resolutions are applied in constructions of non-metrizable higher-dimensional analogues of Anderson, Choquet, and Cook's continua. Certain theorems on dimension-lowering maps are proved for…
We aim to solve a structured convex optimization problem, where a nonsmooth function is composed with a linear operator. When opting for full splitting schemes, usually, primal-dual type methods are employed as they are effective and also…
Most approximation methods in high dimensions exploit smoothness of the function being approximated. These methods provide poor convergence results for non-smooth functions with kinks. For example, such kinks can arise in the uncertainty…
We consider the problem of maximizing a monotone nondecreasing set function under multiple constraints, where the constraints are also characterized by monotone nondecreasing set functions. We propose two greedy algorithms to solve the…
In this paper, we study the stochastic homogenization for a family of integral functionals with convex and nonstandard growth integrands defined on Orlicz-Sobolev's spaces. One fundamental in this topic is to extend the classical…
A compactness of the Revuz map is established in the sense that the locally uniform convergence of a sequence of positive continuous additive functionals is derived in terms of their smooth measures. To this end, we first introduce a metric…
We introduce the notion of trace convexity for functions and respectively, for subsets of a compact topological space. This notion generalizes both classical convexity of vector spaces, as well as Choquet convexity for compact metric…
We develop a functional extension of an extremal principle by Schneider (Monatsh. Math., 1967) by introducing generalized outer linearizations of convex functions. Given a coercive convex function on $\mathbb{R}^n$, a generalized outer…
This paper is about the technique of {\em shadow variables} that was used in the theory of monotone operators. In this paper, we use it to show that certain results that were originally proved for lower semicontinuous convex functions are…
We demonstrate two new important properties of the 1-path-norm of shallow neural networks. First, despite its non-smoothness and non-convexity it allows a closed form proximal operator which can be efficiently computed, allowing the use of…
Difference of convex (DC) functions cover a broad family of non-convex and possibly non-smooth and non-differentiable functions, and have wide applications in machine learning and statistics. Although deterministic algorithms for DC…
We introduce a class of stochastic algorithms for minimizing weakly convex functions over proximally smooth sets. As their main building blocks, the algorithms use simplified models of the objective function and the constraint set, along…
In this paper, we derive optimality conditions (Chebyshev approximation) for multivariate functions. The theory of Chebyshev (uniform) approximation for univariate functions is very elegant. The optimality conditions are based on the notion…
In this paper, we study a geometric property of a continuous plurisubharmonic function which is a solution of the Monge-Amp\`ere equation and has a convex level set. To prove our main theorem, we show a minimum principle of a maximal…
We provide a convergence result for sequences of random variables taking values in a metric space that satisfy a stochastic quasi-Fej\'er monotonicity condition, in the context of a (local) compactness assumption. Our result is quantitative…