Article ID: | iaor20127762 |
Volume: | 40 |
Issue: | 6 |
Start Page Number: | 564 |
End Page Number: | 567 |
Publication Date: | Nov 2012 |
Journal: | Operations Research Letters |
Authors: | Zhang Qing-Bang |
Keywords: | programming: convex |
In this paper, a modified proximal point algorithm with errors, which consists of a resolvent operator technique step with errors followed by a modified orthogonal projection onto a moving half‐space, is constructed for approximating the solution of the general variational inclusion in Hilbert space. The convergence of the iterative sequence is shown under weak assumptions. The results improve and extend some known results.