Related papers: Disconnectedness and unboundedness of the solution…
This paper establishes several upper and lower estimates for the maximal number of the connected components of the solution sets of monotone affine vector variational inequalities. Our results give a partial solution to Question~2 in [N.D.…
In this paper, we propose criteria for unboundedness of the images of set-valued mappings having closed graphs in Euclidean spaces. We focus on mappings whose domains are non-closed or whose values are connected. These criteria allow us to…
We study the connectedness structure of the proper Pareto solution sets, the Pareto solution sets, the weak Pareto solution sets of polynomial vector variational inequalities, as well as the connectedness structure of the efficient solution…
We study nested variational inequalities, which are variational inequalities whose feasible set is the solution set of another variational inequality. We present a projected averaging Tikhonov algorithm requiring the weakest conditions in…
In this paper, we investigate the nonemptiness of weak Pareto efficient solution set for a class of nonsmooth vector optimization problems on a nonempty closed constraint set without any boundedness and convexity assumptions. First, we…
Solutions of a variational inequality are found by giving conditions for the monotone convergence with respect to a cone of the Picard iteration corresponding to its natural map. One of these conditions is the isotonicity of the projection…
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…
In this paper, we investigate several properties of the solution maps of variational inequalities with polynomial data. First, we prove some facts on the $R_0$-property, the local boundedness, and the upper semicontinuity of the solution…
We show that, for a class of locally solid topologies on vector lattices, a topologically convergent net has an embedded sequence that is unbounded order convergent to the same limit. Our result implies, and often improves, many of the…
An interesting observation is that most pairs of weakly homogeneous mappings have no strongly monotonic property, which is one of the key conditions to ensure the unique solvability of the generalized variational inequality. This paper…
The objective of this paper is to introduce and study a complicated nonlinear system, called coupled variational-hemivariational inequalities, which is described by a highly nonlinear coupled system of inequalities on Banach spaces. We…
Suppose $X$ is a vector lattice and there is a notion of convergence $x_{\alpha} \rightarrow x$ in $X$. Then we can speak of an "unbounded" version of this convergence by saying that $(x_{\alpha})$ unbounded converges to $x\in X$ if $\lvert…
We have investigated mixed-gap vector solitons involving incoherently coupled fundamental and dipole components in a parity-time (PT) symmetric lattice with saturable nonlinearity. For the focusing case, vector solitons emerge from the…
We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…
We consider the variational inequality problem over the intersection of fixed point sets of firmly nonexpansive operators. In order to solve the problem, we present an algorithm and subsequently show the strong convergence of the generated…
We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…
In this short note we provide a proof of boundedness of solutions for a network system composed of heterogeneous nonlinear autonomous systems interconnected over a directed graph. The sole assumptions imposed are that the systems are…
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…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
We introduce and study the convergence properties of a projection-type algorithm for solving the variational inequality problem for point-to-set operators. No monotoni\-city assumption is used in our analysis. The operator defining the…