Related papers: Genericity of well-posed vector optimization probl…
We identify the stochastic processes associated with one-sided fractional partial differential equations on a bounded domain with various boundary conditions. This is essential for modelling using spatial fractional derivatives. We show…
In this paper we study the general minimization vector problem (P), concerning a perturbation mapping, defined in locally convex Hausdorff topological vector spaces where the "WInf" stands for the weak infimum with respect to an ordering…
The present paper is devoted to the study of the well-posedness issue for the density-dependent Euler equations in the whole space. We establish local-in-time results for the Cauchy problem pertaining to data in the Besov spaces embedded in…
In this paper, we generalize the concept of unbounded norm (un) convergence: let $X$ be a normed lattice and $Y$ a vector lattice such that $X$ is an order dense ideal in $Y$; we say that a net $(y_\alpha)$ un-converges to $y$ in $Y$ with…
The global well-posedness for the incompressible Navier-Stokes-Vlasov equations in two spatial dimensions is established by a priori estimates, the characteristic method and the semigroup analysis.
We consider a boundary value problem which describes the frictional antiplane shear of an elastic body. The process is static and friction is modeled with a slip-dependent version of Coulomb's law of dry friction. The weak formulation of…
We provide in a unified way quantitative forms of strong convergence results for numerous iterative procedures which satisfy a general type of Fejer monotonicity where the convergence uses the compactness of the underlying set. These…
We consider different concepts of well-posedness and ill-posedness and their relations for solving nonlinear and linear operator equations in Hilbert spaces. First, the concepts of Hadamard and Nashed are recalled which are appropriate for…
The Zakharov system in dimension $d\leqslant 3$ is shown to be locally well-posed in Sobolev spaces $H^s \times H^l$, extending the previously known result. We construct new solution spaces by modifying the $X^{s,b}$ spaces, specifically by…
A space $Y$ is called an {\em extension} of a space $X$ if $Y$ contains $X$ as a dense subspace. Two extensions of $X$ are said to be {\em equivalent} if there is a homeomorphism between them which fixes $X$ point-wise. For two (equivalence…
Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear. The problem is known to be ${\rm…
We prove well-posedness for a transport-diffusion problem coupled with a wave equation for the potential. We assume that the initial data are small. A bilinear form in the spirit of Kato's proof for the Navier-Stokes equations is used,…
The initial value problem for the Korteweg-deVries equation on the line is shown to be globally well-posed for rough data. In particular, we show global well-posedness for initial data in H^s({\mathbb{R}), -3/10<s.
Generalized entropic projections and dominating points are solutions to convex minimization problems related to conditional laws of large numbers. They appear in many areas of applied mathematics such as statistical physics, information…
Considered is the generalized Korteweg-de Vries-Burgers equation $$ u_{t}+u_{xxx}+uu_{x}+|D_{x}|^{2\alpha}u=0,\quad t\in \mathbb{R}^{+}, x\in \mathbb{R}, $$ with $0\leq \alpha\le 1$. We prove a sharp results on the associated Cauchy problem…
This paper extends algorithms that remove the fixed point bias of decentralized gradient descent to solve the more general problem of distributed optimization over subspace constraints. Leveraging the integral quadratic constraint…
Optimization problems, generalized equations, and the multitude of other variational problems invariably lead to the analysis of sets and set-valued mappings as well as their approximations. We review the central concept of set-convergence…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
In the present paper, several types of efficiency conditions are established for vector optimization problems with cone constraints affected by uncertainty, but with no information of stochastic nature about the uncertain data. Following a…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…