Related papers: Efficiency for multitime vector variational proble…
The object of investigation in this paper are vector nonlinear programming problems with cone constraints. We introduce the notion of a Fritz John pseudoinvex cone-constrained vector problem. We prove that a problem with cone constraints is…
We study fractional variational problems of Herglotz type of variable order. Necessary optimality conditions, described by fractional differential equations depending on a combined Caputo fractional derivative of variable order, are proved.…
Variational Bayes (VB) has become a widely-used tool for Bayesian inference in statistics and machine learning. Nonetheless, the development of the existing VB algorithms is so far generally restricted to the case where the variational…
The vector Riemann-Hilbert problem is analyzed when the entries of its matrix coefficient are meromorphic and almost periodic functions. Three cases for the meromorphic functions, when they have (i) a finite number of poles and zeros…
Pareto efficiency for robust linear programs was introduced by Iancu and Trichakis in [9]. We generalize their approach and theoretical results to robust optimization problems in Euclidean spaces with affine uncertainty. Additionally, we…
Bayesian disease mapping, yet if undeniably useful to describe variation in risk over time and space, comes with the hurdle of prior elicitation on hard-to-interpret random effect precision parameters. We introduce a reparametrized version…
We study the connectedness structure of the proper Pareto solution sets, the Pareto solution sets, the weak Pareto solution sets of polynomial vector variational inequalities, as well as the connectedness structure of the efficient solution…
This paper studies sufficient conditions in a variational obstacle avoidance problem on complete Riemannian manifolds. That is, we minimize an action functional, among a set of admissible curves, which depends on an artificial potential…
In this article, we view the approximate version of Pareto and weak Pareto solutions of the multiobjective optimization problem through the lens of KKT type conditions. We also focus on an improved version of Geoffrion proper Pareto…
We study a multi-objective scheduling problem on two dedicated processors. The aim is to minimize simultaneously the makespan, the total tardiness and the total completion time. This NP-hard problem requires the use of well-adapted methods.…
We consider the Dynamic Map Visitation Problem (DMVP), in which a team of agents must visit a collection of critical locations as quickly as possible, in an environment that may change rapidly and unpredictably during the agents'…
This paper is devoted to the study of approximate solutions for a multiobjective interval-valued optimization problem based on an interval order. We establish new existence theorems of approximate solutions for such a problem under some…
Network Function Virtualization (NFV) has the potential to significantly reduce the capital and operating expenses, shorten product release cycle, and improve service agility. In this paper, we focus on minimizing the total number of…
An effective form of the Variation Evolving Method (VEM), which originates from the continuous-time dynamics stability theory, is developed for the classic time-optimal control problem with control constraint. Within the mathematic…
We are concerned with three types of uncertainties: probabilistic, possibilitistic and interval. By using possibility and necessity measures as an Interval Valued Probability Measure (IVPM), we present IVPM's interval expected values whose…
This paper is concerned with the value function approach to multiobjective bilevel optimization which exploits a lower level frontier-type mapping in order to replace the hierarchical model of two interdependent multiobjective optimization…
In a variety of scientific applications we wish to characterize a physical system using measurements or observations. This often requires us to solve an inverse problem, which usually has non-unique solutions so uncertainty must be…
There are several concepts and definitions that characterize and give optimality conditions for solutions of a vector optimization problem. One of the most important is the first-order necessary optimality condition that generalizes the…
We introduce variational spectral learning (VSL), a machine learning framework for solving partial differential equations (PDEs) that operates directly in the coefficient space of spectral expansions. VSL offers a principled bridge between…
We consider the problem of finding the optimal coefficient vector that maximizes the computation rate at a relay in the compute-and-forward scheme. Based on the idea of sphere decoding, we propose a highly efficient algorithm that finds the…