Related papers: Dually cone-boundedness of a set and applications
The idea of convex sets and various related results in 2-Probabilistic normed spaces were established in [HR]. In this paper, We obtain the concepts of convex series closedness, convex series compactness, boundedness and their…
In this paper generalize Robinson's version of an order cancellation law for subsets of vector spaces in which we cancel by unbounded sets. We introduce the notion of weakly narrow sets in normed spaces, study their properties and prove the…
This paper will generalize what may be termed the "geometric duality theory" of real pre-ordered Banach spaces which relates geometric properties of a closed cone in a real Banach space, to geometric properties of the dual cone in the dual…
The paper studies a general norm minimization problem on a product of normed vector spaces. We establish dual necessary and sufficient optimality conditions and derive explicit formulas for the corresponding solution sets. These formulas…
A closed convex subset of a normed linear space is said to have the strong separation property if it can be strongly separated from every other disjoint closed and convex set by a closed hyperplane. In this paper we give some results on the…
Asymmetric vector norms are generalizations of asymmetric norms, where the subadditivity inequality is understood in ordered vector space sense. This relation imposes strong conditions on the ordering itself. This note studies on these…
The notions and certain fundamental characteristics of the proximal and limiting normal cones with respect to a set are first presented in this paper. We present the ideas of the limiting coderivative and subdifferential with respect to a…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
We discuss, on finite and infinite dimensional normed vector spaces, some versions of Radstr\"{o}m cancellation law (or lemma) that are suited for applications to set optimization problems. In this sense, we call our results "conic"…
In this paper we establish a general framework in which the verification of support theorems for generalized convex functions acting between an algebraic structure and an ordered algebraic structure is still possible. As for the domain…
In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…
This article presents a deep investigation of fixed points for multivalued weak contractions in cone metric spaces. We extend Berinde weak contraction principles to the multivalued setting in cone metric spaces, developing existence,…
Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…
In this paper, we mainly study one class of mixed-integer nonlinear programming problems (MINLPs) with vector conic constraint in Banach spaces. Duality theory of convex vector optimization problems applied to this class of MINLPs is deeply…
In this work we study a constrained monotone inclusion involving the normal cone to a closed vector subspace and a priori information on primal solutions. We model this information by imposing that solutions belongs to the fixed point set…
In this note, we completely describe the shape of the bisector of two given points in a two-dimensional normed vector space. More precisely, we show that, depending on the position of two given points with respect to the shape of the unit…
Convex sets appear in various mathematical theories, and are used to define notions such as convex functions and hulls. As an abstraction from the usual definition of convex sets in vector spaces, we formalize in Coq an intrinsic…
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…
We study the class of compact convex subsets of a topological vector space which admits a strictly convex and lower semicontinuous function. We prove that such a compact set is embeddable in a strictly convex dual Banach space endowed with…
On a manifold or a closed subset of a Euclidean vector space, a retraction enables to move in the direction of a tangent vector while staying on the set. Retractions are a versatile tool to perform computational tasks such as optimization,…