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

DOI10.1023/A:1022610425736zbMATH Open0985.90089OpenAlexW50403911WikidataQ123130290 ScholiaQ123130290MaRDI QIDQ1807692FDOQ1807692

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Fenchel duality and the strong conical hull intersection property

Cited In (3)

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

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)