Proof of a conjecture by Deutsch, Li, and Swetits on duality of optimization problems

DOI10.1023/A:1022610425736MaRDI QIDQ1807692zbMATH OpenOpenAlexWikidataFDO

Authors Heinz H. Bauschke

Publication date 19 December 1999

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

Full work available at URL https://doi.org/10.1023/a:1022610425736

zbMATH Keywords

convex optimizationFenchel duality

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)

Recommendations

• Strong duality for generalized convex optimization problems
• On the relationship between fenchel and Lagrange duality for optimization problems in general spaces
• The duality framework for constrained optimization problems
• Conjugate duality for generalized convex optimization problems
• Some results on dual vector optimization problems

Cites work

• scientific article; zbMATH DE number 3933858 (Why is no real title available?)
• scientific article; zbMATH DE number 3955816 (Why is no real title available?)
• Fenchel duality and the strong conical hull intersection property

Cited in

(3)

• Fenchel duality in infinite-dimensional setting and its applications.
• On the conjecture by Demyanov-Ryabova in converting finite exhausters
• A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.

This page was built for publication: Proof of a conjecture by Deutsch, Li, and Swetits on duality of optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807692)