Algorithm duality from resolvent Moreau identities

Duality is classically defined as a relationship between objective functions, one that breaks down beyond convexity. We show that a more fundamental duality persists between the resolvent operators used to solve associated problems. We establish a framework from which we obtain complete characteriza