In this paper, we propose a distributed algorithm for computation of a generalized Nash
equilibrium (GNE) in noncooperative games over networks. We consider games in which the …

We consider the problem of solving dual monotone inclusions involving sums of composite
parallel-sum type operators. A feature of this work is to exploit explicitly the properties of the …

We propose a primal-dual splitting algorithm for solving monotone inclusions involving a
mixture of sums, linear compositions, and parallel sums of set-valued and Lipschitzian …

We consider the application of the type-I Anderson acceleration to solving general
nonsmooth fixed-point problems. By interleaving with safeguarding steps and employing a …

This work proposes block-coordinate fixed point algorithms with applications to nonlinear
analysis and optimization in Hilbert spaces. The asymptotic analysis relies on a notion of …

Obtaining sharp Lipschitz constants for feed-forward neural networks is essential to assess
their robustness in the face of perturbations of their inputs. We derive such constants in the …

We propose a variable metric forward–backward splitting algorithm and prove its
convergence in real Hilbert spaces. We then use this framework to derive primal-dual …

The goal of this article is to promote the use of fixed point strategies in data science by
showing that they provide a simplifying and unifying framework to model, analyze, and solve …

We propose a geometric framework to describe and analyse a wide array of operator
splitting methods for solving monotone inclusion problems. The initial inclusion problem …

We consider aggregative games with affine coupling constraints, where agents have partial
information on the aggregate value and can only communicate with neighboring agents. We …