4 papers · 1 filter
Proximity operator characterization for abstract convex functions
Ewa Bednarczuk, The Hung Tran
We consider proximity operator as a selector of the subgradient in the context of abstract convexity and characterize its properties in term of minimization problems. We also inves…
Primal-Dual algorithms for Abstract convex functions with respect to quadratic functions
Ewa Bednarczuk, The Hung Tran
We consider the saddle point problem where the objective functions are abstract convex with respect to the class of quadratic functions. We propose primal-dual algorithms using the…
Primal-dual algorithm for weakly convex functions under sharpness conditions
Ewa Bednarczuk, The Hung Tran, Monika Syga
We investigate the convergence of the primal-dual algorithm for composite optimization problems when the objective functions are weakly convex. We introduce a modified duality gap…
Forward-Backward algorithms for weakly convex problems
Ewa Bednarczuk, Giovanni Bruccola, Gabriele Scrivanti +1
We investigate the convergence properties of exact and inexact forward-backward algorithms to minimise the sum of two weakly convex functions defined on a Hilbert space, where one…