Related papers: Vector Equilibrium Problems on Dense Sets
In this paper we derive new second-order optimality conditions for a very general set-constrained optimization problem where the underlying set may be nononvex. We consider local optimality in specific directions (i.e., optimal in a…
The problem of finding the sparsest vector (direction) in a low dimensional subspace can be considered as a homogeneous variant of the sparse recovery problem, which finds applications in robust subspace recovery, dictionary learning,…
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 configuration of lattice vectors is supernormal if it contains a Hilbert basis for every cone spanned by a subset. We study such configurations from various perspectives, including triangulations, integer programming and Groebner bases.…
We characterise equality cases in matrix H\"older's inequality and develop a divergence formulation of optimal transport of vector measures. As an application, we reprove the representation formula for measures in the polar cone to monotone…
In this note we study a minimization problem for a vector of measures subject to a prescribed interaction matrix in the presence of external potentials. The conductors are allowed to have zero distance from each other but the external…
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area with location and congestion dependent costs. We study both…
In the Segment Intersection Graph Representation Problem, we want to represent the vertices of a graph as straight line segments in the plane such that two segments cross if and only if there is an edge between the corresponding vertices.…
The paper suggests a new --- to the best of the author's knowledge --- characterization of decisions which are optimal in the multi-objective optimization problem with respect to a definite proper preference cone, a Euclidean cone with a…
We prove various results on the size and structure of subsets of vector spaces over finite fields which, in some sense, have too many mutually orthogonal pairs of vectors. In particular, we obtain sharp finite field variants of a theorem of…
We consider a class of first-order partial differential operators, acting on the space of ultradifferentiable periodic functions, and we describe their range by using the following conditions on the coefficients of the operators: the…
We consider relative or subjective optimization problems where the goal function and feasible set are dependent of the current state of the system under consideration. In general, they are formulated as quasi-equilibrium problems, hence…
In this paper, we design a new iterative algorithm for solving pseudomonotone equilibrium problems in real Hilbert spaces. The advantage of our algorithm is that it requires only one strongly convex programming problem at each iteration.…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
Kuhn-Tucker conditions for mathematical programming problems in Banach spaces partially ordered by cone with empty interior are obtained under strong simultaneity condition. If partial ordered cone has interior point, it is proved that…
This paper investigates the uniqueness of a nonnegative vector solution and the uniqueness of a positive semidefinite matrix solution to underdetermined linear systems. A vector solution is the unique solution to an underdetermined linear…
We analyze a convex stochastic optimization problem where the state is assumed to belong to the Bochner space of essentially bounded random variables with images in a reflexive and separable Banach space. For this problem, we obtain…
Via a random construction we establish necessary conditions for $L^p(\ell^q)$ inequalities for certain families of operators arising in harmonic analysis. In particular we consider dilates of a convolution kernel with compactly supported…
We show that the VC-density of any partitioned formula in a pair of ordered vector spaces is bounded above by twice the number of parameter variables. We also show that this bound is optimal and, as a by-product, we prove that no dense pair…
Recent developments in set optimization are surveyed and extended including various set relations as well as fundamental constructions of a convex analysis for set- and vector-valued functions, and duality for set optimization problems.…