The Hung Tran, Ewa Bednarczuk
Published 2022-09-06Version 1
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.
Perturbation analysis of a class of composite optimization problems
Sampling as optimization in the space of measures: The Langevin dynamics as a composite optimization problem
Lagrange duality on DC evenly convex optimization problems via a generalized conjugation scheme
![QR code for arXiv:2209.02177 [math.OC]](http://oss.arxitics.com/images/favicon.svg)