A new approach to strong duality for composite vector optimization problems
From MaRDI portal
Publication:5009161
DOI10.1080/02331934.2020.1745796zbMath1483.90148OpenAlexW3013166354MaRDI QIDQ5009161
No author found.
Publication date: 19 August 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1745796
functional inequalitiesqualification conditionsstable Farkas lemmacomposite vector functionscomposite vector optimization problems
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)
Related Items (2)
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions for a class of composite multiobjective nonsmooth optimization problems
- Farkas' lemma: three decades of generalizations for mathematical optimization
- A duality approach for a class of semivectorial bilevel programming problems
- Convex composite multi-objective nonsmooth programming
- Farkas' lemma for separable sublinear inequalities without qualifications
- Functional inequalities and theorems of the alternative involving composite functions
- Optimality conditions for weak efficiency to vector optimization problems with composed convex functions
- Conjugate duality in convex optimization
- Existence theorems in vector optimization
- On supremum of a set in a multidimensional space
- Conjugate duality in vector optimization
- Complete characterizations of robust strong duality for robust vector optimization problems
- Inequality systems and global optimization
- Duality for the robust sum of functions
- New Farkas-type results for vector-valued functions: a non-abstract approach
- Farkas-type results for vector-valued functions with applications
- An approach to calmness of linear inequality systems from Farkas lemma
- Qualification conditions and Farkas-type results for systems involving composite functions
- Conjugate duality for multiobjective composed optimization problems
- New constraint qualification and conjugate duality for composed convex optimization problems
- Vector optimization. Set-valued and variational analysis.
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces
- Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming
- Duality for vector optimization problems via a general scalarization
- Inertial forward–backward methods for solving vector optimization problems
- Duality in Vector Optimization
- From the Farkas Lemma to the Hahn--Banach Theorem
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- A closedness condition and its applications to DC programs with convex constraints
- Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency
This page was built for publication: A new approach to strong duality for composite vector optimization problems
