Related papers: Genericity of well-posed vector optimization probl…
In this paper we study the well-posedness of the Cauchy problem for first order hyperbolic systems with constant multiplicities and with low regularity coefficients depending just on the time variable. We consider Zygmund and log-Zygmund…
A stochastic PDE, describing mesoscopic fluctuations in systems of weakly interacting inertial particles of finite volume, is proposed and analysed in any finite dimension $d\in\mathbb{N}$. It is a regularised and inertial version of the…
Motivated by recent increased interest in optimization algorithms for non-convex optimization in application to training deep neural networks and other optimization problems in data analysis, we give an overview of recent theoretical…
The Cauchy problem for the Zakharov system in four dimensions is considered. Some new well-posedness results are obtained. For small initial data, global well-posedness and scattering results are proved, including the case of initial data…
In this paper, we propose a Newton method for unconstrained set optimization problems to find its weakly minimal solutions with respect to lower set-less ordering. The objective function of the problem under consideration is given by…
In this paper, we establish the existence of the efficient solutions for polynomial vector optimization problems on a nonempty closed constraint set without any convexity and compactness assumptions. We first introduce the relative…
This paper explores some sufficient conditions for the enhanced solvability of strong vector equilibrium problems, which can be established via a variational approach. Enhanced solvability here means existence of solutions, which are strong…
In this paper we analyse the well-posedness of the Cauchy problem for a rather general class of hyperbolic systems with space-time dependent coefficients and with multiple characteristics of variable multiplicity. First, we establish a…
Variable order structures model situations in which the comparison between two points depends on a point-to-cone map. In this paper, an inexact projected gradient method for solving smooth constrained vector optimization problems on…
We consider the modified Zakharov-Kuznetsov (mZK) equation in two space dimensions in both focusing and defocusing cases. Using the $I$-method, we prove the global well-posedness of the $H^s$ solutions for $s>\frac{3}{4}$ for any data in…
In this paper, we mainly study one class of mixed-integer nonlinear programming problems (MINLPs) with vector conic constraint in Banach spaces. Duality theory of convex vector optimization problems applied to this class of MINLPs is deeply…
We consider the well-posedness of the family of dispersion generalized Benjamin-Ono equations. Earlier work of Herr-Ionescu-Kenig-Koch established well-posedness with data in $L^2$, by using a discretized gauge transform in the setting of…
In decision-making problems under uncertainty, probabilistic constraints are a valuable tool to express safety of decisions. They result from taking the probability measure of a given set of random inequalities depending on the decision…
In this paper, we prove that the Cauchy problem associated to the following higher-order Benjamin-Ono equation $$ \partial_tv-b\mathcal{H}\partial^2_xv- a\epsilon \partial_x^3v=cv\partial_xv-d\epsilon…
It is well known that finite-dimensional polyhedral convex sets can be generated by finitely many points and finitely many directions. Representation formulas in this spirit are obtained for convex polyhedra and generalized convex polyhedra…
This paper presents a study of generalized polyhedral convexity under basic operations on multifunctions. We address the preservation of generalized polyhedral convexity under sums and compositions of multifunctions, the domains and ranges…
This paper provides a framework to show the concentration of solutions $Y^*$ to convex minimizing problem where the objective function $\phi(X)(Y)$ depends on some random vector $X$ satisfying concentration of measure hypotheses. More…
Let $X$ be a vertex subset of a graph $G$. Then $u, v\in V(G)$ are $X$-positionable if $V(P)\cap X \subseteq \{u,v\}$ holds for any shortest $u,v$-path $P$. If each two vertices from $X$ are $X$-positionable, then $X$ is a general position…
In this paper, we consider a multiobjective optimal control problem where the preference relation in the objective space is defined in terms of a pointed convex cone containing the origin, which defines generalized Pareto optimality. For…
It is proved that: each collectively order continuous set of operators from an Archimedean OVS with a generating cone to an OVS is collectively order bounded; and each collectively order to norm bounded set of operators from an ordered…