In this work we analyze a first order method especially tailored for smooth saddle point problems, based on an alternating extragradient scheme. The proposed method is based on three successive projection steps, which can be computed also with respect to non Euclidean metrics. The stepsize...

We establish a region of convergence for the proto-typical non-convex Douglas–Rachford iteration which finds a point on the intersection of a line and a circle. Previous work on the non-convex iteration Borwein and Sims (Fixed-point algorithms for inverse problems in science and engineering,...

We introduce a hybrid method for finding a common element in the solutions set of an equilibrium problem and the common fixed points set of a countable family of relatively quasi-nonexpansive mappings in a Banach space. A strong convergence theorem of the proposed method is established by using...

The training of some types of neural networks leads to separable non-linear least squares problems. These problems may be ill-conditioned and require special techniques. A robust algorithm based on the Variable Projections method of Golub and Pereyra is designed for a class of feed-forward...