Related papers: Minimax theorems in a fully non-convex setting
For a class of discrete quasi convex functions called semi-strictly quasi M$^\natural$-convex functions, we investigate fundamental issues relating to minimization, such as optimality condition by local optimality, minimizer cut property,…
The problem of minimizing convex functionals of probability distributions is solved under the assumption that the density of every distribution is bounded from above and below. A system of sufficient and necessary first-order optimality…
We study a class of statistical inverse problems with non-linear pointwise operators motivated by concrete statistical applications. A two-step procedure is proposed, where the first step smoothes the data and inverts the non-linearity.…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
By using elementary yet interesting observations and refining techniques used in a recent work by Fei Xue et al., we present new upper bounds for covering functionals of convex polytopes in $\mathbb{R}^n$ with few vertices. In these…
In this paper, we establish some new inequalities for class of SX(h,I) convex functions which are supermultiplicative or superadditive and nonnegative. And we also give some applications for special means.
A function is exponentially concave if its exponential is concave. We consider exponentially concave functions on the unit simplex. In a previous paper we showed that gradient maps of exponentially concave functions provide solutions to a…
This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…
We present an optimization problem emerging from optimal control theory and situated at the intersection of fractional programming and linear max-min programming on polytopes. A na\"ive solution would require solving four nested, possibly…
We present results about minimization of convex functionals defined over a finite set of vectors in a finite dimensional Hilbert space, that extend several known results for the Benedetto-Fickus frame potential. Our approach depends on…
In this paper we study the regularity of the local minima of integral functionals: in particular, not convexity (quasi-convexity, policonvexity or rank one convexity) hypothesis will be made on the density, neither structure hypothesis nor…
A complete family of functional Steiner formulas is established. As applications, an explicit representation of functional intrinsic volumes using special mixed Monge-Amp\`ere measures and a new version of the Hadwiger theorem on convex…
In this paper we prove two theorems. The first one is a structure result that describes the extrinsic geometry of an embedded surface with constant mean curvature (possibly zero) in a homogeneously regular Riemannian three-manifold, in any…
In this paper, given two Banach spaces $X, Y$ and a $C^1$ functional $\Phi:X\times Y\to {\bf R}$, under general assumptions, we show that either $\Phi$ has a saddle-point in $X\times Y$ or, for each convex and dense set $S\subseteq Y$,…
In information theory, some optimization problems result in convex optimization problems on strictly convex functionals of probability densities. In this note, we study these problems and show conditions of minimizers and the uniqueness of…
Convex-concave min-max problems are ubiquitous in machine learning, and people usually utilize first-order methods (e.g., gradient descent ascent) to find the optimal solution. One feature which separates convex-concave min-max problems…
We analyze matrix convex functions of a fixed order defined on a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus. We obtain for each order conditions for matrix…
In a recent article (2022) we proved with L. Zaj\'i\v{c}ek that if $ G\subset\R^n $ is an unbounded open convex set that does not contain a translation of a convex cone with non-empty interior, then there exist $ f:G\to\R $ and a concave…
A monotone function interval is the set of monotone functions that lie pointwise between two fixed monotone functions. We characterize the set of extreme points of monotone function intervals and apply this to a number of economic settings.…
We prove the existence of minimizers for functionals defined over the class of convex domains contained inside a bounded set D of R^N and with prescribed volume. Some applications are given, in particular we prove that the eigenvalues of…