A Perturbation Approach to Vector Optimization Problems: Lagrange and Fenchel-Lagrange Duality
N. Dinh, D.H. Long

TL;DR
This paper develops a perturbation approach to vector optimization problems, establishing duality results including Lagrange and Fenchel-Lagrange duality, with applications to various classes of cone-constrained vector problems.
Contribution
It introduces new perturbation mappings and duality frameworks for vector optimization, including stable strong duality results and novel Fenchel-Lagrange duality theorems.
Findings
Established representations of conjugate epigraphs
Proved vector Farkas lemmas and duality theorems
Derived new Fenchel-Lagrange duality results for vector problems
Abstract
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 . 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Contact Mechanics and Variational Inequalities
