Necessary and sufficient conditions for stable conjugate duality
From MaRDI portal
(Redirected from Publication:2492483)
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
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 4046373 (Why is no real title available?)
- scientific article; zbMATH DE number 18672 (Why is no real title available?)
- scientific article; zbMATH DE number 887371 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- A dual condition for the convex subdifferential sum formula with applications
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- A simple closure condition for the normal cone intersection formula
- Closedness conditions for the optimality of a family of non-convex optimization problems
- Duality and infinite dimensional optimization
- Fenchel duality in infinite-dimensional setting and its applications.
- Generalizations of Slater's constraint qualification for infinite convex programs
- On weak * closedness, coerciveness, and inf-sup theorems
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Subdifferential calculus using -subdifferentials
Cited in
(30)- Characterizations of robust and stable duality for linearly perturbed uncertain optimization problems
- On the necessity of the Moreau-Rockafellar-Robinson qualification condition in Banach spaces
- Necessary and sufficient conditions for globally stable convex minimax theorems
- Revisiting some rules of convex analysis
- A Comparison of Some Recent Regularity Conditions for Fenchel Duality
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- The Hahn–Banach–Lagrange theorem
- The stable duality of DC programs for composite convex functions
- Stable strong Fenchel and Lagrange duality for evenly convex 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
- Strong and total Fenchel dualities for robust convex optimization problems
- Duality for optimization problems with infinite sums
- Some dual characterizations of Farkas-type results for fractional programming problems
- -optimality conditions for composed convex optimization problems
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Conditions for zero duality gap in convex programming
- Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- Generalized Moreau–Rockafellar results for composed convex functions
- A dual criterion for maximal monotonicity of composition operators
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- Duality for -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
- A study of convex convex-composite functions via infimal convolution with applications
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)
