A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
From MaRDI portal
Publication:2490774
DOI10.1016/j.na.2005.09.017zbMath1087.49026MaRDI QIDQ2490774
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
regularity condition; Fenchel duality; strong conical hull intersection property; subdifferential sum formula
90C25: Convex programming
90C46: Optimality conditions and duality in mathematical programming
49J52: Nonsmooth analysis
49N60: Regularity of solutions in optimal control
49N15: Duality theory (optimization)
Related Items
Some characterizations of duality for DC optimization with composite functions, New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions, The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces, New duality results for evenly convex optimization problems, Unnamed Item, Strong and total duality for constrained composed optimization via a coupling conjugation scheme, Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality, Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces, Applications of convex analysis within mathematics, Robust duality in parametric convex optimization, On a zero duality gap result in extended monotropic programming, Closedness type regularity conditions for surjectivity results involving the sum of two maximal monotone operators, On optimal allocation of risk vectors, Revisiting some rules of convex analysis, On epsilon-stability in optimization, On robust duality for fractional programming with uncertainty data, Functional inequalities and theorems of the alternative involving composite functions, Duality for \(\varepsilon \)-variational inequalities via the subdifferential calculus, On totally Fenchel unstable functions in finite dimensional spaces, New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces, \(\varepsilon\)-optimality conditions for composed convex optimization problems, Dual representations for convex risk measures via conjugate duality, Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming, An application of the bivariate inf-convolution formula to enlargements of monotone operators, Optimality conditions and duality for DC programming in locally convex spaces, Characterizations of robust solution set of convex programs with uncertain data, Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization, 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, The stable duality of DC programs for composite convex functions, A new condition for maximal monotonicity via representative functions, The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions, Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems, On strong and total Lagrange duality for convex optimization problems, The stable Farkas lemma for composite convex functions in infinite dimensional spaces, A Comparison of Some Recent Regularity Conditions for Fenchel Duality, Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements, Weaker Constraint Qualifications in Maximal Monotonicity, On an open problem regarding totally Fenchel unstable functions, Generalized Moreau–Rockafellar results for composed convex functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong duality for generalized convex optimization problems
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Generalizations of Slater's constraint qualification for infinite convex programs
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- 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
- Fenchel duality and the strong conical hull intersection property
- Proof of a conjecture by Deutsch, Li, and Swetits on duality of optimization problems
- An alternative formulation for a new closed cone constraint qualification
- Extension of Fenchel's duality theorem for convex functions
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- The Fenchel duality theorem in Fréchet spaees
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- A simple closure condition for the normal cone intersection formula
- Conjugate functions and subdifferentials in nonnormed situations for operators with complete graphs
- 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
