Some formulae of convex and nonconvex duality

DOI10.1007/BF01027112zbMath0810.49038MaRDI QIDQ1332557

Michel Volle

Publication date: 6 April 1995

Published in: Set-Valued Analysis (Search for Journal in Brave)

zbMATH Keywords

nonconvex duality; convex duality; inf-convolution; subdifferentiability

Mathematics Subject Classification ID

49J52: Nonsmooth analysis

49N15: Duality theory (optimization)

49J27: Existence theories for problems in abstract spaces

Related Items

Lower CS-closed sets and functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Convex analysis and measurable multifunctions
• Duality in nonconvex optimization
• A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
• The occasional distributivity of ∘ over+e and the change of variable formula for conjugate functions
• Solvability results for sublinear functions and operators
• A General Formula on the Conjugate of the Difference of Functions
• A Fenchel-Rockafellar type duality theorem for maximization
• Convex Functions with Unbounded Level Sets and Applications to Duality Theory
• Conjugate functions and subdifferentials in nonnormed situations for operators with complete graphs
• Duality and infinite dimensional optimization
• Convex Analysis
• On uniformly convex functions