A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems (Q1021801): Difference between revisions

Using the concept of \(A\)-monotonicity in a Hilbert space, the author applies the generalized over-relaxed A-proximal point algorithm to approximate the solution of the following inclusion problem: Find \(x\) such that \(0\in Mx\). As a result, linear convergence of the resulting method is established under standard assumptions.