arXiv Analytics

Sign in

arXiv:2105.14312 [math.OC]AbstractReferencesReviewsResources

A Perturbation Approach to Vector Optimization Problems: Lagrange and Fenchel-Lagrange Duality

N. Dinh, D. H. Long

Published 2021-05-29Version 1

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 generated by a convex cone $K$. Several representations of the epigraph of the conjugate mapping of the perturbation mapping are established. From these, variants vector Farkas lemmas are then proved. Armed with these basic tools, the {\it dual} and the so-called {\it loose dual problem} of (P) are defined, and then stable strong duality results between these pairs of primal-dual problems are established. The results just obtained are then applied to a general class (CCCV) of composed vector optimization problems with cone-constrained. For this classes of problems, four perturbation mappings are suggested. Each of these mappings yields several forms of vector Farkas lemmas and two forms of dual problems for (CCVP). Concretely, one of the suggested perturbation mapping give rises to well-known {\it Lagrange} and {\it loose Lagrange dual problems} for (CCVP) while each of the three others, yields two kinds of Fenchel-Lagrange dual problems for (CCVP). Stable strong duality for these pairs of primal-dual problems are proved. Several special cases of (CCVP) are also considered at the end of the paper, including: vector composite problems (without constraints), cone-constrained vector problems, and scalar composed problems. The results obtained in this papers when specified to the two concrete mentioned vector problems go some Lagrange duality results appeared recently, and also lead to new results on stable strong Fenchel-Lagrange duality results, which, to the best knowledge of the authors, appear for the first time in the literature.

Related articles: Most relevant | Search more
arXiv:1602.03367 [math.OC] (Published 2016-02-10)
Characterizing weak solutions for vector optimization problems
arXiv:2407.13245 [math.OC] (Published 2024-07-18)
Descent Methods for Vector Optimization Problems: A Majorization-Minimization Perspective
arXiv:2101.12542 [math.OC] (Published 2021-01-29)
On some efficiency conditions for vector optimization problems with uncertain cone constraints: a robust approach