New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems

DOI10.1080/02331934.2021.2017431zbMath1528.90240arXiv2105.13299OpenAlexW3165474520MaRDI QIDQ6106320

No author found.

Publication date: 27 June 2023

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.13299

zbMATH Keywords

qualification conditionsvector inequalities(stable) vector Farkas lemmasextended epigraphs of conjugate mappingsLagrange and Fenchel-Lagrange duality for vector optimization problems

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)

Related Items (2)

A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality ⋮ Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints

Cites Work

• Higher-order duality in vector optimization over cones
• Functional inequalities and theorems of the alternative involving composite functions
• Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality
• Conjugate duality in convex optimization
• Existence theorems in vector optimization
• Conjugate duality in vector optimization
• Complete characterizations of robust strong duality for robust vector optimization problems
• Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
• New Farkas-type results for vector-valued functions: a non-abstract approach
• Farkas-type results for vector-valued functions with applications
• Qualification conditions and Farkas-type results for systems involving composite functions
• A general approach for studying duality in multiobjective optimization
• The strong conical hull intersection property for convex programming
• Duality in Vector Optimization
• A closedness condition and its applications to DC programs with convex constraints
• A new approach to strong duality for composite vector optimization problems
• Optimality conditions and total dualities for conic programming involving composite function
• A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems
• Set-valued Optimization
• Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
• A new approach to duality in vector optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems