Duality for Composite Optimization Problem within the Framework of Abstract Convexity

From MaRDI portal

DOI10.1080/02331934.2022.2132822MaRDI QIDQ6409791arXivFDO

Authors Ewa M. Bednarczuk, the Hung Tran

Publication date 5 September 2022

Published in arXiv

Full work available at URL https://doi.org/10.1080/02331934.2022.2132822


Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

arXiv classification

math.OC


Abstract: We study conjugate and Lagrange dualities for composite optimization problems within the framework of abstract convexity. We provide conditions for zero duality gap in conjugate duality. For Lagrange duality, intersection property is applied to obtain zero duality gap. Connection between Lagrange dual and conjugate dual is also established. Examples related to convex and weakly convex functions are given.












This page was built for publication: Duality for Composite Optimization Problem within the Framework of Abstract Convexity

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Duality_for_Composite_Optimization_Problem_within_the_Framework_of_Abstract_Convexity&oldid=95208782"
Powered by MediaWiki