Related papers: Vector Equilibrium Problems on Dense Sets
We prove that if a subset of the d-dimensional vector space over a finite field is large enough, then it contains many k-tuples of mutually orthogonal vectors.
The paper is devoted to the existence of weak Pareto solutions and the weak sharp minima at infinity property for a general class of constrained nonconvex vector optimization problems with unbounded constraint set via asymptotic cones and…
A vector space partition of $\mathbb{F}_q^v$ is a collection of subspaces such that every non-zero vector is contained in a unique element. We improve a lower bound of Heden, in a subcase, on the number of elements of the smallest occurring…
In this manuscript, we consider a control system governed by a general ordinary differential equation on a Riemannian manifold, with its endpoints satisfying some inequalities and equalities, and its control constrained to a closed convex…
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…
We study the fixed point problem for a system of multivariate operators that are coordinate-wise monotone (i.e., nondecreasing or nonincreasing in each of the variables, independently), in the setting of quasi-ordered sets. We show that…
In this article, we work with set-valued optimization problems in locally convex topological vector spaces. We prove the equivalencies of some definitions of generalized convex maps introduced by Jeyakumar, Yang, Yang & Yang & Chen, as well…
We consider a class of (ill-posed) optimal control problems in which a distributed vector-valued control is enforced to pointwise take values in a finite set $\mathcal{M}\subset\mathbb{R}^m$. After convex relaxation, one obtains a…
The numerical performance of algorithms can be studied using test sets or procedures that generate such problems. This paper proposes various methods for generating linear, semidefinite, and second-order cone optimization problems.…
We study the extragradient method for solving vector quasi-equilibrium problems in Banach spaces, which generalizes the extragradient method for vector equilibrium problems and scalar quasi-equilibrium problems. We propose a regularization…
In this paper, we study a distributed optimization problem for a class of high-order multi-agent systems with unknown dynamics. In comparison with existing results for integrators or linear agents, we need to overcome the difficulties…
Gauge bosons associated to new gauge symmetries under which the standard model particles are not charged are predicted in many extensions of the standard model of particles and interactions. We show that under very general conditions, the…
Linear vector equations and inequalities are considered defined in terms of idempotent mathematics. To solve the equations, we apply an approach that is based on the analysis of distances between vectors in idempotent vector spaces. The…
We prove existence and uniqueness of a solution to the problem of minimizing the logarithmic energy of vector potentials associated to a $d$-tuple of positive measures supported on closed subsets of the complex plane. The assumptions we…
Variational inequalities are a formalism that includes games, minimization, saddle point, and equilibrium problems as special cases. Methods for variational inequalities are therefore universal approaches for many applied tasks, including…
The basic tool for solving problems in metric geometry and isotonic regression is the metric projection onto closed convex cones. Isotonicity of these projections with respect to a given order relation can facilitate finding the solutions…
We introduce a notion of subunit vector field for fully nonlinear degenerate elliptic equations. We prove that an interior maximum of a viscosity subsolution of such an equation propagates along the trajectories of subunit vector fields.…
We consider a nonlinear control system with vector-valued measures as controls and with dynamics depending on time delayed states. First, we introduce a notion of discontinuous, bounded variation solution associated with this system and…
In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (Evans-Steuer) algorithm [12]. Different from it, the…
New versions and extensions of Benson's outer approximation algorithm for solving linear vector optimization problems are presented. Primal and dual variants are provided in which only one scalar linear program has to be solved in each…