Fenchel duality in infinite-dimensional setting and its applications.
From MaRDI portal
Publication:1421158
DOI10.1016/j.na.2003.07.008zbMath1045.90080MaRDI QIDQ1421158
Publication date: 26 January 2004
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.2003.07.008
90C46: Optimality conditions and duality in mathematical programming
49N15: Duality theory (optimization)
46T05: Infinite-dimensional manifolds
Related Items
The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces, A Global Approach to Nonlinearly Constrained Best Approximation, Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors, Relationships between polyhedral convex sets and generalized polyhedral convex sets, Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials, Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization, Bounded linear regularity of convex sets in Banach spaces and its applications, The strong conical hull intersection property for convex programming, A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces., Necessary and sufficient conditions for stable conjugate duality, A new geometric condition for Fenchel's duality in infinite dimensional spaces, Generalized differentiation and duality in infinite dimensions under polyhedral convexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 and the strong conical hull intersection property
- Proof of a conjecture by Deutsch, Li, and Swetits on duality of optimization problems
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- Duality for optimization and best approximation over finite intersections
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- 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
- Duality and infinite dimensional optimization
- Level Sets and Continuity of Conjugate Convex Functions