We provide two closed, convex sets with nonempty intersection and an initial point for which the Douglas-Rachford algorithm converges weakly but not strongly. This resolves an open question as noted earlier by Arag\'on Artacho, Borwein and Tam (2014, Remark 2.2). Our construction is a simple lift of a recent constructi...
This paper develops a dual-space preconditioning framework for variational inequalities and root-finding problems beyond classical cocoercivity and Lipschitz continuity assumptions. To this end, we introduce both a novel cocoercivity-type condition and a relaxed Lipschitz continuity condition, and derive convergence of...
Jan Quan, Konstantinos A. Oikonomidis, Alexander Bodard et al.· 0 citations
We propose a smoothed augmented Lagrangian method (ALM) for solving mathematical programs with vertical complementarity constraints (VCCs). The augmented Lagrangian function involving the VCCs is smoothed by the Lasry--Lions double envelope, which is an extension of the Moreau envelope that enjoys enhanced smoothness p...
Jia Wang, Andreas Themelis, Panagiotis Patrinos· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.