Fenchel's duality theorem for nearly convex functions

DOI10.1007/s10957-007-9234-9zbMath1165.90022OpenAlexW2084099445MaRDI QIDQ946335

Gert Wanka, Radu Ioan Boţ, Sorin-Mihai Grad

Publication date: 23 September 2008

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-007-9234-9

zbMATH Keywords

conjugate functionsFenchel dualiltynearby convex functions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Convex functions and convex programs in convex geometry (52A41)

Related Items (8)

Unnamed Item ⋮ Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions ⋮ Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings ⋮ Unnamed Item ⋮ Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap ⋮ On a sufficient condition for equality of two maximal monotone operators ⋮ Duality for almost convex optimization problems via the perturbation approach ⋮ The set of controllable multi-input systems is generically convex

Cites Work

• Inequality systems and optimization
• Strong duality for generalized convex optimization problems
• Convex Analysis
• On Quasi-Convex Duality
• Quasiconvex Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fenchel's duality theorem for nearly convex functions