  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.

Optimization and Control