A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
DOI10.1016/J.NA.2005.09.017zbMATH Open1087.49026OpenAlexW2055572834MaRDI QIDQ2490774FDOQ2490774
Authors: Radu I. Boţ, Gert Wanka
Publication date: 18 May 2006
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2005.09.017
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.
regularity conditionFenchel dualitystrong conical hull intersection propertysubdifferential sum formula
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Regularity of solutions in optimal control (49N60) Duality theory (optimization) (49N15)
Cites Work
- An alternative formulation for a new closed cone constraint qualification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Generalizations of Slater's constraint qualification for infinite convex programs
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- 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
- Extension of Fenchel's duality theorem for convex functions
- Fenchel duality in infinite-dimensional setting and its applications.
- Title not available (Why is that?)
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- Fenchel duality and the strong conical hull intersection property
- 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
- Farkas-Type Results With Conjugate Functions
- Strong duality for generalized convex optimization problems
- Conjugate functions and subdifferentials in nonnormed situations for operators with complete graphs
- Title not available (Why is that?)
- The Fenchel duality theorem in Fréchet spaees
- Proof of a conjecture by Deutsch, Li, and Swetits on duality of optimization problems
Cited In (45)
- On an open problem regarding totally Fenchel unstable functions
- Revisiting some rules of convex analysis
- On epsilon-stability in optimization
- On strong and total Lagrange duality for convex optimization problems
- A Comparison of Some Recent Regularity Conditions for Fenchel Duality
- New duality results for evenly convex optimization problems
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- On totally Fenchel unstable functions in finite dimensional spaces
- The stable duality of DC programs for composite convex functions
- Formulas for sequential Pareto subdifferentials of the sums of vector mappings and applications to optimality conditions
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
- Strong CHIP of convex sets and epi-sum regularity
- An application of the bivariate inf-convolution formula to enlargements of monotone operators
- Dual representations for convex risk measures via conjugate duality
- Lower semicontinuous type regularity conditions for subdifferential calculus
- Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces
- Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems
- On optimal allocation of risk vectors
- New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
- Functional inequalities and theorems of the alternative involving composite functions
- On a zero duality gap result in extended monotropic programming
- Strong and total duality for constrained composed optimization via a coupling conjugation scheme
- A dual condition for the convex subdifferential sum formula with applications
- 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
- \(\varepsilon\)-optimality conditions for composed convex optimization problems
- Some characterizations of duality for DC optimization with composite functions
- Robust duality in parametric convex optimization
- Closedness type regularity conditions for surjectivity results involving the sum of two maximal monotone operators
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- On robust duality for fractional programming with uncertainty data
- Applications of convex analysis within mathematics
- 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 new condition for maximal monotonicity via representative functions
- Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality
- 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
- Duality for \(\varepsilon \)-variational inequalities via the subdifferential calculus
- Optimality conditions and duality for DC programming in locally convex spaces
- Weaker Constraint Qualifications in Maximal Monotonicity
- Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
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)