A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
From MaRDI portal
Publication:2490774
Recommendations
- A dual condition for the convex subdifferential sum formula with applications
- New regularity conditions for Lagrange and Fenchel-Lagrange duality in infinite dimensional spaces
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- A Comparison of Some Recent Regularity Conditions for Fenchel Duality
- Fenchel duality in infinite-dimensional setting and its applications.
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 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 1755826 (Why is no real title available?)
- scientific article; zbMATH DE number 887371 (Why is no real title available?)
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- A dual condition for the convex subdifferential sum formula with applications
- A simple closure condition for the normal cone intersection formula
- An alternative formulation for a new closed cone constraint qualification
- Best Approximation from the Intersection of a Closed Convex Set and a Polyhedron in Hilbert Space, Weak Slater Conditions, and the Strong Conical Hull Intersection Property
- Conjugate functions and subdifferentials in nonnormed situations for operators with complete graphs
- Extension of Fenchel's duality theorem for convex functions
- Farkas-Type Results With Conjugate Functions
- Fenchel duality and the strong conical hull intersection property
- Fenchel duality in infinite-dimensional setting and its applications.
- Generalizations of Slater's constraint qualification for infinite convex programs
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Proof of a conjecture by Deutsch, Li, and Swetits on duality of optimization problems
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Strong duality for generalized convex optimization problems
- The Fenchel duality theorem in Fréchet spaees
Cited in
(45)- Functional inequalities and theorems of the alternative involving composite functions
- A new condition for maximal monotonicity via representative functions
- Dual representations for convex risk measures via conjugate duality
- Robust duality in parametric convex optimization
- Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems
- On an open problem regarding totally Fenchel unstable functions
- On strong and total Lagrange duality for convex optimization problems
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Closedness type regularity conditions for surjectivity results involving the sum of two maximal monotone operators
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- On optimal allocation of risk vectors
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- On a zero duality gap result in extended monotropic programming
- An application of the bivariate inf-convolution formula to enlargements of monotone operators
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- Strong CHIP of convex sets and epi-sum regularity
- \(\varepsilon\)-optimality conditions for composed convex optimization problems
- New duality results for evenly convex optimization problems
- Duality for \(\varepsilon \)-variational inequalities via the subdifferential calculus
- Weaker Constraint Qualifications in Maximal Monotonicity
- Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality
- A Comparison of Some Recent Regularity Conditions for Fenchel Duality
- Revisiting some rules of convex analysis
- On epsilon-stability in optimization
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
- The stable duality of DC programs for composite convex functions
- Some characterizations of duality for DC optimization with composite functions
- Formulas for sequential Pareto subdifferentials of the sums of vector mappings and applications to optimality conditions
- Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty
- Strong and total duality for constrained composed optimization via a coupling conjugation scheme
- A dual condition for the convex subdifferential sum formula with applications
- Optimality conditions and duality for DC programming in locally convex spaces
- On totally Fenchel unstable functions in finite dimensional spaces
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces
- Lower semicontinuous type regularity conditions for subdifferential calculus
- Applications of convex analysis within mathematics
- On robust duality for fractional programming with uncertainty data
- Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization
- Strong and total Fenchel dualities for robust composed convex optimization problems in locally convex spaces
- Characterizations of robust solution set of convex programs with uncertain data
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
- 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
This page was built for publication: A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490774)
