Farkas-type results for vector-valued functions with applications
This paper considers an optimization problem posed in a real locally convex Hausdorff topological vector space with a vector-valued objective function. The goal is to provide Farkas-type results for such problems and to show that the obtained results have interesting applications in several fields. After giving some preliminaries in Section 2, Section 3 characterizes the inclusion of the feasible set into some reverse-convex set. The main results are given in Theorems 3.1. and 3.2, where asymptotic non-convex/reverse-convex Farkas lemmas are presented. These results are used to obtain asymptotic non-convex/linear and convex/reverse-convex Farkas lemmas and also a stable convex/reverse-convex Farkas lemma. Then Section 4 gives some reverse and non-asymptotic Farkas-type results under alternative qualification conditions involving the data. In Section 5, weak solutions of vector optimization problems are characterized. Section 6 discusses some interesting applications to vector variational inequalities (Section 6.1) and vector equilibrium problems (Section 6.2). Finally, some perspectives and conclusions are given. It can be noted that most of the results presented in this paper are free of usual standard assumptions in the literature.
- Approximate Farkas lemmas for vector systems with applications to convex vector optimization problems
- New Farkas-type constraint qualifications in convex infinite programming
- New Farkas-type results for vector-valued functions: a non-abstract approach
- Robust optimization revisited via robust vector Farkas lemmas
- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
- Conjugate duality in convex optimization
- Conjugate duality in vector optimization
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
- Duality and optimality conditions for generalized equilibrium problems involving DC functions
- Duality for generalized equilibrium problem
- Duality in Vector Optimization
- Farkas' lemma: three decades of generalizations for mathematical optimization
- From the Farkas lemma to the Hahn-Banach theorem
- Functional inequalities and theorems of the alternative involving composite functions
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- Infinite dimensional analysis. A hitchhiker's guide.
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- On Extension of Fenchel Duality and its Application
- Optimality conditions for approximate solutions of convex semi-infinite vector optimization problems
- Qualification conditions and Farkas-type results for systems involving composite functions
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Set-valued optimization. An introduction with applications
- Solution concepts in vector optimization: a fresh look at an old story
- Vector Optimization with Infimum and Supremum
- Complete characterizations of robust strong duality for robust vector optimization problems
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
- Vector topical functions and Farkas type theorems with applications
- A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality
- On set containment characterizations for sets described by set-valued maps with applications
- Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications
- New Farkas-type results for vector-valued functions: a non-abstract approach
- scientific article; zbMATH DE number 714139 (Why is no real title available?)
- Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications
- Approximate Farkas lemmas for vector systems with applications to convex vector optimization problems
- A new approach to strong duality for composite vector optimization problems
- Optimality conditions and total dualities for conic programming involving composite function
- Characterizations of approximate duality and saddle point theorems for nonsmooth robust vector optimization
- A unified approach to robust Farkas-type results with applications to robust optimization problems
- New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems
- Primal and dual characterizations for Farkas type lemmas in terms of closedness criteria
- Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality
This page was built for publication: Farkas-type results for vector-valued functions with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363561)
