Necessary and sufficient conditions for stable conjugate duality
DOI10.1016/J.NA.2005.07.034zbMATH Open1091.49031OpenAlexW2088296457WikidataQ58048544 ScholiaQ58048544MaRDI QIDQ2492483FDOQ2492483
Authors: R. S. Burachik, V. Jeyakumar, Zhiyou Wu 
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
Recommendations
- Duality for the sum of convex functions in general normed spaces
- Necessary and sufficient conditions for globally stable convex minimax theorems
- A Comparison of Some Recent Regularity Conditions for Fenchel Duality
- Stable and total Fenchel duality for convex optimization problems in locally convex spaces
- Conditions for zero duality gap in convex programming
constraint qualificationsconvex programmingconjugate dualitypolyhedral functionssublinear functionsepigraph regularity
Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Cites Work
- Title not available (Why is that?)
- Subdifferential calculus using \(\varepsilon\)-subdifferentials
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalizations of Slater's constraint qualification for infinite convex programs
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- A dual condition for the convex subdifferential sum formula with applications
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- A simple closure condition for the normal cone intersection formula
- Fenchel duality in infinite-dimensional setting and its applications.
- Title not available (Why is that?)
- Closedness conditions for the optimality of a family of non-convex optimization problems
- Duality and infinite dimensional optimization
- On weak * closedness, coerciveness, and inf-sup theorems
- Title not available (Why is that?)
Cited In (29)
- Necessary and sufficient conditions for globally stable convex minimax theorems
- On the necessity of the Moreau-Rockafellar-Robinson qualification condition in Banach spaces
- Revisiting some rules of convex analysis
- A Comparison of Some Recent Regularity Conditions for Fenchel Duality
- The Hahn–Banach–Lagrange theorem
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- Duality for Optimization Problems with Infinite Sums
- The stable duality of DC programs for composite convex functions
- Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
- Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems
- An application of the bivariate inf-convolution formula to enlargements of monotone operators
- Kuhn–Tucker Conditions for a Convex Programming Problem in Banach Spaces Partially Ordered by Cone with Empty Interior
- A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces
- Exact relaxations for parametric robust linear optimization problems
- A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications
- Strong and total Fenchel dualities for robust convex optimization problems
- Some dual characterizations of Farkas-type results for fractional programming problems
- \(\varepsilon\)-optimality conditions for composed convex optimization problems
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Generalized Moreau–Rockafellar results for composed convex functions
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- A dual criterion for maximal monotonicity of composition operators
- Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- Duality for \(\varepsilon \)-variational inequalities via the subdifferential calculus
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- A closedness condition and its applications to DC programs with convex constraints
- Stable and total Fenchel duality for composed convex optimization problems
This page was built for publication: Necessary and sufficient conditions for stable conjugate duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492483)
