This paper presents a scheme for generating the Pareto front of multiobjective optimization problems by solving a sequence of constrained single-objective problems. Since the necessity of determining the constraint value a priori can be a serious drawback of the original epsilon-constraint method, our scheme generates appropriate constraint values adaptively during the run. A simple example pro...

In this paper, we study the non-monotone adaptive submodular maximization problem subject to a cardinality constraint. We first revisit random greedy algorithm proposed in \citep{gotovos2015non}, where they show that achieves $1/e$ approximation ratio if objective function is and pointwise submodular. It not clear whether same guarantee holds under submodularity (without resorting submodularity...

The most important issue in multi-objective optimization problems is to determine the Pareto points along the Pareto frontier. If the optimization problem involves multiple conflicting objectives, the results obtained from the Pareto-optimality will have the trade-off solutions that shaping the Pareto frontier. Each of these solutions lies at the boundary of the Pareto frontier, such that the i...

using the notion of “belongingness ($epsilon$)” and “quasi-coincidence (q)” of fuzzy points with fuzzy sets, we introduce the concept of an ($ alpha, beta$)- fuzzyhv-ideal of an hv-ring, where , are any two of {$epsilon$, q,$epsilon$ $vee$ q, $epsilon$ $wedge$ q} with $ alpha$ $neq$ $epsilon$ $wedge$ q. since the concept of ($epsilon$, $epsilon$ $vee$ q)-fuzzy hv-ideals is an important and ...

in this paper, we introduce the notion of ($epsilon $, $epsilon $ $vee$ q_{k})− fuzzy subnear-ring which is a generalization of ($epsilon $, $epsilon $ $vee$ q)−fuzzy subnear-ring. we have given examples which are ($epsilon $, $epsilon $ $vee$ q_{k})−fuzzy ideals but they are not ($epsilon $, $epsilon $ $vee$ q)−fuzzy ideals. we have also introduced the notions of ($epsilon $, $epsilon $ $vee$ ...

Human stereo vision works by fusing a pair of perspective images with a purely horizontal parallax. Recent developments suggest that very few varieties of multiperspective stereo pairs exist. In this paper, we introduce a new stereo model, which we call epsilon stereo pairs, for fusing a broader class of multiperspective images. An epsilon stereo pair consists of two images with a slight vertic...

Conditional gradient algorithms (aka Frank–Wolfe algorithms) form a classical set of methods for constrained smooth convex minimization due to their simplicity, the absence projection steps, and competitive numerical performance. While vanilla algorithm only ensures worst-case rate $${\mathcal {O}}(1/\epsilon )$$ , various recent results have shown that strongly functions on polytopes, method c...

computationally, selection of a proper numerical value for infinitesimal non archimedean epsilon in dea models has some difficulties. although there are several algorithms for selecting the proper non-archimedean epsilon, it is important to introduce methods in order to calculate the efficiency of dmus without using epsilon. one of these methods is a two-phase method, which obtains the efficien...