Necessary and sufficient conditions for stable conjugate duality
From MaRDI portal
Publication:2492483
DOI10.1016/j.na.2005.07.034zbMath1091.49031OpenAlexW2088296457WikidataQ58048544 ScholiaQ58048544MaRDI QIDQ2492483
Zhi-You Wu, Regina Sandra Burachik, Vaithilingam Jeyakumar
Publication date: 9 June 2006
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/33778
convex programmingconstraint qualificationsconjugate dualitypolyhedral functionssublinear functionsepigraph regularity
Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Related Items
The stable duality of DC programs for composite convex functions ⋮ Stable and total Fenchel duality for composed convex optimization problems ⋮ Kuhn–Tucker Conditions for a Convex Programming Problem in Banach Spaces Partially Ordered by Cone with Empty Interior ⋮ A Comparison of Some Recent Regularity Conditions for Fenchel Duality ⋮ Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs ⋮ A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality ⋮ Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality ⋮ Some dual characterizations of Farkas-type results for fractional programming problems ⋮ Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ Robust conjugate duality for convex optimization under uncertainty with application to data classification ⋮ \(\varepsilon\)-optimality conditions for composed convex optimization problems ⋮ Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems ⋮ A dual criterion for maximal monotonicity of composition operators ⋮ A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions ⋮ Revisiting some rules of convex analysis ⋮ On the necessity of the Moreau-Rockafellar-Robinson qualification condition in Banach spaces ⋮ A closedness condition and its applications to DC programs with convex constraints ⋮ Strong and total Fenchel dualities for robust convex optimization problems ⋮ The Hahn–Banach–Lagrange theorem ⋮ The stable Farkas lemma for composite convex functions in infinite dimensional spaces ⋮ An application of the bivariate inf-convolution formula to enlargements of monotone operators ⋮ Exact relaxations for parametric robust linear optimization problems ⋮ Stable strong Fenchel and Lagrange duality for evenly convex optimization problems ⋮ Generalized Moreau–Rockafellar results for composed convex functions ⋮ Duality for Optimization Problems with Infinite Sums ⋮ Duality for \(\varepsilon \)-variational inequalities via the subdifferential calculus ⋮ A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications
Cites Work
- On weak * closedness, coerciveness, and inf-sup theorems
- Generalizations of Slater's constraint qualification for infinite convex programs
- Subdifferential calculus using \(\varepsilon\)-subdifferentials
- Fenchel duality in infinite-dimensional setting and its applications.
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Closedness conditions for the optimality of a family of non-convex optimization problems
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- A simple closure condition for the normal cone intersection formula
- Duality and infinite dimensional optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
