Related papers: On Certain Properties of Convex Functions
This work provides formulae for the $\epsilon$-subdifferential of integral functions in the framework of complete $\sigma$-finite measure spaces and locally convex spaces. In this work we present here new formulae for this…
Some boundedness properties of function spaces (considered as topological groups) are studied.
This paper studies simple bilevel problems, where a convex upper-level function is minimized over the optimal solutions of a convex lower-level problem. We first show the fundamental difficulty of simple bilevel problems, that the…
This paper investigates general and generalized differentiation properties of the optimal value function associated with perturbed optimization problems. Fundamental results on nearly convex sets and functions in infinite-dimensional spaces…
We prove that certain Bellman functions of several variables are the minimal locally concave functions. This generalizes earlier results about Bellman functions of two variables.
In this paper provide sufficient and necessary conditions for the minimax equality for extended-valued $\Phi$-convex functions. As an application we establish sufficient and necessary conditions for the minimax equality for convex-concave…
In the present paper, the following convexity principle is proved: any closed convex multifunction, which is metrically regular in a certain uniform sense near a given point, carries small balls centered at that point to convex sets, even…
In this paper, we investigate a constrained formulation of neural networks where the output is a convex function of the input. We show that the convexity constraints can be enforced on both fully connected and convolutional layers, making…
Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in $H^k(\Omega)$, and optimizing functionals arising from some…
We propose a new class of convex penalty functions, called \emph{variational Gram functions} (VGFs), that can promote pairwise relations, such as orthogonality, among a set of vectors in a vector space. These functions can serve as…
In this paper, we unify and improve existing results on characterizing strict and almost stricty convex functions via subdifferential mapping, Moreau envelope, and proximal mappings. In particular, it is shown that if a convex function is…
The main goal of this paper is to present results of existence and non-existence of convex functions on Riemannian manifolds and, in the case of the existence, we associate such functions to the geometry of the manifold. Precisely, we prove…
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…
It is known that inner functions exist on strongly pseudoconvex domains. In this paper we will show that they exist on a more general type of domains, including some domains of finite type.
The condition number of a differentiable convex function, namely the ratio of its smoothness to strong convexity constants, is closely tied to fundamental properties of the function. In particular, the condition number of a quadratic convex…
We prove the local convergence to minima and estimates on the rate of convergence for the stochastic gradient descent method in the case of not necessarily globally convex nor contracting objective functions. In particular, the results are…
In this paper, using some aspects of convex functions, we refine discrete Jensen's inequality via weight functions. Then, using these results, we give some applications in different abstract spaces and obtain some new interesting…
In this paper, we study some optimization problems in uniformly convex and uniformly smooth Bochner spaces. We consider four cases of the underlying subsets: closed and convex subsets, closed and convex cones, closed subspaces and closed…
We introduce and study the notion of (e,y)-conjugate for a proper and e-convex function in locally convex spaces, which is an extension of the concept of the conjugate. The mutual relationships between the concepts of (e,y)-conjugacy and…
Several optimization schemes have been known for convex optimization problems. However, numerical algorithms for solving nonconvex optimization problems are still underdeveloped. A progress to go beyond convexity was made by considering the…