Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection
For ¥0.57 per day, unlimited downloads CREATE MEMBERSHIP Download

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

Inertial projection algorithms for convex feasibility problem

Author:
Dang, Yazheng   Gao, Yan   Li, Lihua  


Journal:
Journal of Systems Engineering and Electronics


Issue Date:
2012


Abstract(summary):

The purpose of this paper is to apply inertial technique to string averaging projection method and block-iterative projection method in order to get two accelerated projection algorithms for solving convex feasibility problem. Compared with the existing accelerated methods for solving the problem, the inertial technique employs a parameter sequence and two previous iterations to get the next iteration and hence improves the flexibility of the algorithm. Theoretical asymptotic convergence results are presented under some suitable conditions. Numerical simulations illustrate that the new methods have better convergence than the general projection methods. The presented algorithms are inspired by the inertial proximal point algorithm for finding zeros of a maximal monotone operator.


Page:
734-740


VIEW PDF

The preview is over

If you wish to continue, please create your membership or download this.

Create Membership

Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads