Related papers: Necessary conditions for approximate solutions of …
A dominating set of a graph $\mathcal{G=(V, E)}$ is a subset of vertices $S\subseteq\mathcal{V}$ such that every vertex $v\in \mathcal{V} \setminus S$ outside the dominating set is adjacent to a vertex $u\in S$ within the set. The minimum…
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 discuss initial-boundary value problems of arbitrary spatial order subject to arbitrary boundary conditions. We formalise the concept of the conditioning of such a problem and show that it represents a necessary criterion for…
This note considers the maximal positively invariant set for polynomial discrete time dynamics subject to constraints specified by a basic semialgebraic set. The note utilizes a relatively direct, but apparently overlooked, fact stating…
We address the problem of computing a Minimal Dominating Set in highly dynamic distributed systems. We assume weak connectivity, i.e., the network may be disconnected at each time instant and topological changes are unpredictable. We make…
The paper is devoted to deriving novel second-order necessary and sufficient optimality conditions for local minimizers in rather general classes of nonsmooth unconstrained and constrained optimization problems in finite-dimensional spaces.…
This paper studies sufficient conditions in a variational obstacle avoidance problem on complete Riemannian manifolds. That is, we minimize an action functional, among a set of admissible curves, which depends on an artificial potential…
In multi-objective optimization, a single decision vector must balance the trade-offs between many objectives. Solutions achieving an optimal trade-off are said to be Pareto optimal: these are decision vectors for which improving any one…
We show the validity of select existence results for a vector optimization problem, and a variational inequality. More generally, we consider generalized vector quasi-variational inequalities, as well as, fixed point problems on genuine…
Shape optimization problems constrained by variational inequalities (VI) are non-smooth and non-convex optimization problems. The non-smoothness arises due to the variational inequality constraint, which makes it challenging to derive…
This survey synthesizes the current state of the art on the regularity theory for solutions to the optimal partition problem. Namely, we consider non-negative, vector-valued Sobolev functions whose components have mutually disjoint support,…
The paper is concerned with a family of geometric evolution problems, modeling the spatial control of an invasive population within a region $V\subset \R^2$ bounded by geographical barriers. If no control is applied, the contaminated set…
The purpose of this paper is to characterize the weak efficient solutions, the efficient solutions, and the isolated efficient solutions of a given vector optimization problem with finitely many convex objective functions and infinitely…
This paper deals with generalized differentiability and second-order necessary optimality conditions for a box-constrained optimal control problem governed by an exponential semilinear elliptic equation with discrete measures as sources,…
We provide a generalization of first-order necessary conditions of optimality for infinite-dimensional optimization problems with a finite number of inequality constraints and with a finite number of inequality and equality constraints. Our…
In this paper we consider the minimization of a continuous function that is potentially not differentiable or not twice differentiable on the boundary of the feasible region. By exploiting an interior point technique, we present first- and…
This paper is concerned with the variational inequality problem (VIP) over the fixed point set of a quasi-nonexpansive operator. We propose, in particular, an algorithm which entails, at each step, projecting onto a suitably chosen…
Second-order optimality conditions for vector nonlinear programming problems with inequality constraints are studied in this paper. We introduce a new second-order constraint qualification, which includes Mangasarian-Fromovitz constraint…
In this paper, we study a method for finding robust solutions to multiobjective optimization problems under uncertainty. We follow the set-based minmax approach for handling the uncertainties which leads to a certain set optimization…
We study necessary and sufficient conditions to attain solutions of set-optimization problems in therms of variational inequalities of Stampacchia and Minty type. The notion of a solution we deal with has been introduced Heyde and Loehne,…