Related papers: Genericity of well-posed vector optimization probl…
Problems related to projections on closed convex cones are frequently encountered in optimization theory and related fields. To study these problems, various unifying ideas have been introduced, including asymmetric vector-valued norms and…
In the present work we show that the local generalized monotonicity of a lower semicontinuous set-valued operator on some certain type of dense sets ensures the global generalized monotonicity of that operator. We achieve this goal…
Generalized equations are problems emerging in contexts of modern variational analysis as an adequate formalism to treat such issues as constraint systems, optimality and equilibrium conditions, variational inequalities, differential…
We present two criteria for checking approximate proper efficiency in vector optimization problems with the ordering cone being a nonnegative orthant. Although the criteria can be established by Benson's approach [H.P. Benson, \textit{An…
The Cauchy problem for the 1-dimensional Zakharov system is shown to be globally well-posed for large data which not necessarily have finite energy. The proof combines the local well-posedness result of Ginibre, Tsutsumi, Velo and a general…
In this work we prove local and global well-posedness results for the Cauchy problem of a family of regularized nonlinear Benjamin-type equations in both periodic and nonperiodic Sobolev spaces.
The paper concerns foundations of sensitivity and stability analysis in optimization and related areas, being primarily addressed truncated constrained systems. We consider general models, which are described by multifunctions between…
The paper is devoted to the existence of global optimal solutions for a general class of nonsmooth problems of constrained vector optimization without boundedness assumptions on constraint sets. The main attention is paid to the two major…
In this paper, it is proved a very general well-posedness result for a class of constrained minimization problems.
Vector optimization problems are a generalization of multiobjective optimization in which the preference order is related to an arbitrary closed and convex cone, rather than the nonnegative octant. Due to its real life applications, it is…
In the present paper, the Polyak's principle, concerning convexity of the images of small balls through C1,1 mappings, is employed in the study of vector optimization problems. This leads to extend to such a context achievements of local…
In this work, we provide some novel results that establish both the existence of Henig global proper efficient points and their density in the efficient set for vector optimization problems in arbitrary normed spaces. Our results do not…
Local and global well-posedness results are established for the initial value problem associated to the 1D Zakharov-Rubenchik system. We show that our results are sharp in some situations by proving Ill-posedness results otherwise. The…
We consider a class of infinite-dimensional optimization problems in which a distributed vector-valued variable should pointwise almost everywhere take values from a given finite set $\mathcal{M}\subset\mathbb{R}^m$. Such hybrid…
We study the initial value problem associated to the dispersion generalized Benjamin-Ono equation. Our aim is to establish well-posedness results in weighted Sobolev spaces via contraction principle under minimal requirements in the…
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 characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a…
In this paper, we deal with the following generalized vector equilibrium problem: Let $X, Y$ be topological vector spaces over reals, $D$ be a nonempty subset of $X$, $K$ be a nonempty set and $\theta$ be origin of $Y$. Given multi-valued…
This paper addresses the problem of wellposedness of non-autonomous linear evolution equations $\dot x = A(t)x$ in uniformly convex Banach spaces. We assume that $A(t):D \subset X\to X$, for each $t$ is the generator of a quasi-contractive…
The subject of this article is the introduction of a new concept of well-posedness of Bayesian inverse problems. The conventional concept of (Lipschitz, Hellinger) well-posedness in [Stuart 2010, Acta Numerica 19, pp. 451-559] is difficult…