Related papers: Efficiency for multitime vector variational proble…
In this paper, in the absence of any constraint qualifications, we develop sequential necessary and sufficient optimality conditions for a constrained multiobjective fractional programming problem characterizing a Henig proper efficient…
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 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…
Efficient multiphysics models that can adapt to the varying complexity of physical processes in space and time are desirable for modeling fluid migration in the subsurface. Vertical equilibrium (VE) models are simplified mathematical models…
In this paper, we discuss the concepts of bifunction and geodesic convexity for vector valued functions on Hadamard manifold. The Hadamard manifold is a particular type of Riemannian manifold with non-positive sectional curvature. Using…
We study some functionals associated with a process driven by a fractional boundary value problem (FBVP for short). By FBVP we mean a Cauchy problem with boundary condition written in terms of a fractional equation, that is an equation…
This paper deals with approximate Pareto solutions of a nonsmooth interval-valued multiobjective optimization problem with data uncertainty in constraints. We first introduce some kinds of approximate Pareto solutions for the robust…
Variational inequality problems allow for capturing an expansive class of problems, including convex optimization problems, convex Nash games and economic equilibrium problems, amongst others. Yet in most practical settings, such problems…
We study black-box vector optimization with Gaussian process bandits, where there is an incomplete order relation on objective vectors described by a polyhedral convex cone. Existing black-box vector optimization approaches either suffer…
In this letter we study variational obstacle avoidance problems on complete Riemannian manifolds. The problem consists of minimizing an energy functional depending on the velocity, covariant acceleration and a repulsive potential function…
Support Vector Machine (SVM) algorithm requires a high computational cost (both in memory and time) to solve a complex quadratic programming (QP) optimization problem during the training process. Consequently, SVM necessitates high…
Riemannian convex optimization and minimax optimization have recently drawn considerable attention. Their appeal lies in their capacity to adeptly manage the non-convexity of the objective function as well as constraints inherent in the…
We propose a new approach, multi-view Laplacian support vector machines (SVMs), for semi-supervised learning under the multi-view scenario. It integrates manifold regularization and multi-view regularization into the usual formulation of…
We investigate partial regularity for vector valued local minimizers of double phase functionals, under vectorial obstacle type constraints satisfying appropriate topological properties.
In this paper, we consider interval-valued vector optimization problems $(IVOP)$ and derive their relationships to interval vector variational inequalities $(IVVI)$ of Minty and Stampacchia type in terms of convexificators and LU-efficient…
The Generalized Eigenvalue Problem (GEVP) has been used extensively in the past in order to reliably extract energy levels from time-dependent Euclidean correlators calculated in Lattice QCD. We propose a formulation of the GEVP in…
In this note we provide conditions for local invariance of finite dimensional submanifolds for solutions to stochastic partial differential equations (SPDEs) in the framework of the variational approach. For this purpose, we provide a…
This paper studies a multiobjective bilevel optimization problem where each objective is a fractional function. By reformulating the problem into a single-level one, we establish refined necessary and sufficient optimality conditions. These…
This paper introduces a new routing problem referred to as the vehicle routing problem with vector profits. Given a network composed of nodes (depot/sites) and arcs connecting the nodes, the problem determines routes that depart from the…
In this paper we consider variational problems involving 1-dimensional connected sets in the Euclidean plane, such as the classical Steiner tree problem and the irrigation (Gilbert-Steiner) problem. We relate them to optimal partition…