Related papers: Interval Valued Vector Variational Inequalities an…
In the current paper, we derive the comparison results for the homogeneous and non-homogeneous linear initial value problem (IVP) for $\Psi$-Hilfer fractional differential equations. In the presence of upper and lower solutions, the…
This paper deals with quasi-variational inequality problems (QVIs) in a generic Banach space setting. We provide a theoretical framework for the analysis of such problems which is based on two key properties: the pseudomonotonicity (in the…
We study monotone variational inequalities that can arise as optimality conditions for constrained convex optimisation or convex-concave minimax problems and propose a novel algorithm that uses only one gradient/operator evaluation and one…
In this paper we obtain second- and first-order optimality conditions of Kuhn-Tucker type and Fritz John one for weak efficiency in the vector problem with inequality constraints. In the necessary conditions we suppose that the objective…
Equivalence of convex optimization, saddle-point problems, and variational inequalities is a well-established concept. The variational inequality (VI) is a static problem which is studied under dynamical settings using a framework called…
We study a minimisation problem in $L^p$ and $L^\infty$ for certain cost functionals, where the class of admissible mappings is constrained by the Navier-Stokes equations. Problems of this type are motivated by variational data assimilation…
Due to their importance in practice, dominating set problems in graphs have been greatly studied in past and different formulations of these problems are presented in literature. This paper's focus is on two problems: weakly convex…
We prove weak duality between two recent convex relaxation methods for bounding the optimal value of a constrained variational problem in which the objective is an integral functional. The first approach, proposed by Valmorbida et al. (IEEE…
While Variational Inequality (VI) is a well-established mathematical framework that subsumes Nash equilibrium and saddle-point problems, less is known about its extension, Quasi-Variational Inequalities (QVI). QVI allows for cases where the…
In this paper a variation of the classic vector quantization problem is considered. In the standard formulation, a quantizer is designed to minimize the distortion between input and output when the number of reconstruction points is fixed.…
Motivated by multi-user optimization problems and non-cooperative Nash games in stochastic regimes, we consider stochastic variational inequality (SVI) problems on matrix spaces where the variables are positive semidefinite matrices and the…
In this work we prove that the initial value problem (IVP) associated to the fractional two-dimensional Benjamin-Ono equation $$\left. \begin{array}{rl} u_t+D_x^{\alpha} u_x +\mathcal Hu_{yy} +uu_x &=0,\qquad\qquad (x,y)\in\mathbb R^2,\;…
We develop a method to combine Markov chain Monte Carlo (MCMC) and variational inference (VI), leveraging the advantages of both inference approaches. Specifically, we improve the variational distribution by running a few MCMC steps. To…
We prove the optimal regularity for some class of vector-valued variational inequalities with gradient constraints. We also give a new proof for the optimal regularity of some scalar variational inequalities with gradient constraints. In…
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…
This paper considers weighted sum rate maximization of multiuser multiple-input single-output interference channel (MISO-IFC) under outage constraints. The outage-constrained weighted sum rate maximization problem is a nonconvex…
We develop a fitted value iteration (FVI) method to compute bicausal optimal transport (OT) where couplings have an adapted structure. Based on the dynamic programming formulation, FVI adopts a function class to approximate the value…
This paper addresses the challenging issue of symmetry in mixed-integer convex optimization problems, which frequently arise in real-world applications such as the unit commitment problem. Although variable aggregation techniques have been…
In this work we consider the initial value problem (IVP) associated to the Ostrovsky equations $$\left. \begin{array}{rl} u_t+\partial_x^3 u\pm \partial_x^{-1}u +u \partial_x u &\hspace{-2mm}=0,\qquad\qquad x\in\mathbb R,\; t\in\mathbb R,\\…
We examine the \emph{submodular maximum coverage problem} (SMCP), which is related to a wide range of applications. We provide the first variational approximation for this problem based on the Nemhauser divergence, and show that it can be…