A new iteration technique for nonlinear operators as concerns convex programming and feasibility problems

DOI10.1007/s11075-019-00688-9MaRDI QIDQ2290912

Daya Ram Sahu, Ariana Pitea, Madhushi Verma

Publication date: 29 January 2020

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-019-00688-9

zbMATH Keywords

accretive operator; fixed point; convex programming; \(S\)-iteration process; feasibility problem

Mathematics Subject Classification ID

65H10: Numerical computation of solutions to systems of equations

47H06: Nonlinear accretive operators, dissipative operators, etc.

47J25: Iterative procedures involving nonlinear operators