New Farkas-type results for vector-valued functions: a non-abstract approach
From MaRDI portal
Publication:2315254
DOI10.1007/s10957-018-1352-zzbMath1418.90282OpenAlexW2885842596WikidataQ129430523 ScholiaQ129430523MaRDI QIDQ2315254
Publication date: 2 August 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/170548
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)
Related Items (8)
Robust strong duality for nonconvex optimization problem under data uncertainty in constraint ⋮ A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality ⋮ New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems ⋮ A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems ⋮ On set containment characterizations for sets described by set-valued maps with applications ⋮ Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality ⋮ Painlevé-Kuratowski convergences of the solution sets for vector optimization problems with free disposal sets ⋮ A new approach to strong duality for composite vector optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Functional inequalities and theorems of the alternative involving composite functions
- Conjugate duality in convex optimization
- On supremum of a set in a multidimensional space
- Conjugate duality in vector optimization
- Further generalizations of Farkas' theorem and their applications in optimal control
- A very short algebraic proof of the Farkas lemma
- Vector topical functions and Farkas type theorems with applications
- Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior
- Necessary conditions for super minimizers in constrained multiobjective optimization
- Farkas-type results for vector-valued functions with applications
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces
- Vector Optimization and Monotone Operators via Convex Duality
- Vector Optimization with Infimum and Supremum
- Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization
- Solution concepts in vector optimization: a fresh look at an old story
- Duality in Vector Optimization
- From the Farkas Lemma to the Hahn--Banach Theorem
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Farkas-Type Results With Conjugate Functions
- Set-valued Optimization
- Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
This page was built for publication: New Farkas-type results for vector-valued functions: a non-abstract approach
