Related papers: w-Invexity and Optimality Problem
A function $F$ defined on all subsets of a finite ground set $E$ is quasi-concave if $F(X\cup Y)\geq\min\{F(X),F(Y)\}$ for all $X,Y\subset E$. Quasi-concave functions arise in many fields of mathematics and computer science such as social…
In this paper, we studied the equilibrium problem where the bi-function may be quasiconvex with respect to the second variable and the feasible set is the intersection of a finite number of convex sets. We propose a projection-algorithm,…
The minimization of a nonconvex composite function can model a variety of imaging tasks. A popular class of algorithms for solving such problems are majorization-minimization techniques which iteratively approximate the composite nonconvex…
Extended real-valued functions are often used in optimization theory, but in different ways for infimum problems and for supremum problems. We present an approach to extended real-valued functions that works for all types of problems and…
We consider supervised learning problems in which set predictions provide explicit uncertainty estimates. Using Choquet integrals (a.k.a. Lov{\'a}sz extensions), we propose a convex loss function for nondecreasing subset-valued functions…
We study convex and quasiconvex functions on a metric graph. Given a set of points in the metric graph, we consider the largest convex function below the prescribed datum. We characterize this largest convex function as the unique largest…
Let $V$ be a finite nonempty set. A transit function is a map $R:V\times V\rightarrow 2^V$ such that $R(u,u)=\{u\}$, $R(u,v)=R(v,u)$ and $u\in R(u,v)$ hold for every $u,v\in V$. A set $K\subseteq V$ is $R$-convex if $R(u,v)\subset K$ for…
There exist two major subclasses in the class of superquadratic functions, one comprises concave and decreasing functions, while the other consists of convex and monotone increasing functions. Leveraging this distinction, we introduce…
A new class of functions called L-fuzzy weakly Semi-Preopen (Semi-Preclosed) functions in L-fuzzy topological spaces are introduced in this paper. Some characterizations of this class and its properties and the relationship with other…
In the present paper, a systematic study is made of quantitative semicontinuity (a.k.a. Lipschitzian) properties of certain multifunctions, which are defined as a solution map associated to a family of parameterized ``split" feasibility…
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 present the application of variational-wavelet analysis to numerical/analytical calculations of Wigner functions in (nonlinear) quasiclassical beam dynamics problems. (Naive) deformation quantization and multiresolution representations…
This is a tutorial introduction to the functional analysis mathematics needed in many physical problems, such as in waves in continuous media. Functional analysis takes us beyond finite matrices, allowing us to work with infinite sets of…
Almost automorphy in the context of hyperfunctions is the main aim of this work. We give different equivalent definitions of almost automorphic hyperfunctions and then we study this class of hyperfunctions.
This paper investigates a category of constrained fractional optimization problems that emerge in various practical applications. The objective function for this category is characterized by the ratio of a numerator and denominator, both…
Convex approximation sets for multiobjective optimization problems are a well-studied relaxation of the common notion of approximation sets. Instead of approximating each image of a feasible solution by the image of some solution in the…
Minimax optimization has been central in addressing various applications in machine learning, game theory, and control theory. Prior literature has thus far mainly focused on studying such problems in the continuous domain, e.g.,…
In typical applications of Bayesian optimization, minimal assumptions are made about the objective function being optimized. This is true even when researchers have prior information about the shape of the function with respect to one or…
In this paper we consider quasi-concave set functions defined on antimatroids. There are many equivalent axiomatizations of antimatroids, that may be separated into two categories: antimatroids defined as set systems and antimatroids…
Coreset is usually a small weighted subset of $n$ input points in $\mathbb{R}^d$, that provably approximates their loss function for a given set of queries (models, classifiers, etc.). Coresets become increasingly common in machine learning…