Lagrange duality for evenly convex optimization problems
From MaRDI portal
Publication:255070
DOI10.1007/s10957-015-0775-zzbMath1365.90198OpenAlexW2213495066MaRDI QIDQ255070
F. Blanchet-Sadri, M. Dambrine
Publication date: 9 March 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-015-0775-z
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Convexity of real functions of several variables, generalizations (26B25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (7)
A comparison of alternative c-conjugate dual problems in infinite convex optimization ⋮ Set-valued evenly convex functions: characterizations and C-conjugacy ⋮ Strong and total duality for constrained composed optimization via a coupling conjugation scheme ⋮ Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme ⋮ New duality results for evenly convex optimization problems ⋮ \(e^{\prime }\)-convex sets and functions: properties and characterizations ⋮ Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The e-support function of an e-convex set and conjugacy for e-convex functions
- Conjugate duality in convex optimization
- Characterizations of evenly convex sets and evenly quasiconvex functions
- On linear systems containing strict inequalities
- Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization
- Variational analysis for the consumer theory
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- An alternative formulation for a new closed cone constraint qualification
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Analyzing linear systems containing strict inequalities via evenly convex hulls
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- Quasiconvex duality theory by generalized conjugation methods
This page was built for publication: Lagrange duality for evenly convex optimization problems
