Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems
From MaRDI portal
Publication:2440517
DOI10.2478/s11533-013-0294-9zbMath1284.49041MaRDI QIDQ2440517
Sorin-Mihai Grad, Horaţiu-Vasile Boncea
Publication date: 19 March 2014
Published in: Central European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/s11533-013-0294-9
conjugate functions; constraint qualifications; epigraphs; \(\varepsilon\)-duality gap; \(\varepsilon\)-sudifferentials; Fenchel-Lagrange dual problems; Lagrange dual problems
90C25: Convex programming
49J52: Nonsmooth analysis
49N60: Regularity of solutions in optimal control
90C34: Semi-infinite programming
49N15: Duality theory (optimization)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- On strong and total Lagrange duality for convex optimization problems
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- An alternative formulation for a new closed cone constraint qualification
- Duality in Vector Optimization
- Weaker Constraint Qualifications in Maximal Monotonicity
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- Lower semicontinuous type regularity conditions for subdifferential calculus
- Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
- Generalized Moreau–Rockafellar results for composed convex functions
- Farkas-Type Results With Conjugate Functions
- Maximal Monotonicity for the Precomposition with a Linear Operator
