Related papers: On VC-minimal theories and variants
In this paper, vector optimization is considered in the framework of decision making and optimization in general spaces. Interdependencies between domination structures in decision making and domination sets in vector optimization are…
We introduce the notions of $\varepsilon$-approximate fixed point and weak $\varepsilon$-approximate fixed point. We show that for a group of unitary matrices even the existence of a nontrivial weak $\varepsilon$-approximate fixed point for…
Detecting hidden convexity is one of the tools to address nonconvex minimization problems. After giving a formal definition of hidden convexity, we introduce the notion of conditional infimum, as it will prove instrumental in detecting…
We bound the number of nearly orthogonal vectors with fixed VC-dimension over $\setpm^n$. Our bounds are of interest in machine learning and empirical process theory and improve previous bounds by Haussler. The bounds are based on a simple…
In this paper, approximate optimality conditions and sensitivity analysis in nearly convex optimization are discussed. More precisely, as in the spirit of convex analysis, we introduce the concept of $\varepsilon$-subdifferential for nearly…
In this paper, we investigate several subsets of $n$-copulas and $n$-quasi-copulas from the perspective of convex-lineability and the recently introduced concept of convex-spaceability. Our purpose is to determine when such families contain…
Let $\Omega $ be a bounded ${\mathcal{C}}^{\infty}$-smoothly bounded domain in ${\mathbb{C}}^{n}.$ For such a domain we define a new notion between strict pseudo-convexity and pseudo-convexity: the size of the set $W$ of weakly…
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…
One revisits the standard saddle-point method based on conjugate duality for solving convex minimization problems. Our aim is to reduce or remove unnecessary topological restrictions on the constraint set. Dual equalities and…
The paper introduces a general strategy for identifying strong local minimizers of variational functionals. It is based on the idea that any variation of the integral functional can be evaluated directly in terms of the appropriate…
A weak notion of elastic energy for (not necessarily regular) rectifiable curves in any space dimension is proposed. Our $p$-energy is defined through a relaxation process, where a suitable $p$-rotation of inscribed polygonals is adopted.…
We construct a family of functions suitable for establishing lower bounds on the oracle complexity of first-order minimization of smooth strongly-convex functions. Based on this construction, we derive new lower bounds on the complexity of…
We study Medvedev reducibility in the context of set theory -- specifically, forcing and large cardinal hypotheses. Answering a question of Hamkins and Li \cite{HaLi}, we show that the Medvedev degrees of countable ordinals are far from…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
Weak sharp minimality is a notion emerged in optimization, whose utility is largeley recognized in the convergence analysis of algorithms for solving extremum problems as well as in the study of the perturbation behaviour of such problems.…
We show that certain families of sets in $\mathbb{R}^2$ (or $\mathbb{R}^n$) which are neither definable nor have bounded VC-dimension are nonetheless uniformly approximately definable in the real field, an o-minimal structure.
We study linear orderings expanded by functions for successor and predecessor. The successor and predecessor on linear orderings capture the relatively intrinsically computably enumerable information about orderings in much the same way…
The notion of unboundedly order converges has been recieved recently a particular attention by several authors. The main result of the present paper shows that the notion is efficient and deserves that care. It states that a vector lattice…
A classical counterexample due to E. De Giorgi, shows that the weak maximum principle does not remain true for general linear elliptic differential systems. After that, there are some efforts to establish the weak maximum principle for…
The (extensional) theory of arrays is widely used to model systems. Hence, efficient decision procedures are needed to model check such systems. Current decision procedures for the theory of arrays saturate the read-over-write and…