Abstract

A general structure is established that allows the comparison of various conditions that are sufficient for convergence of algorithms that can be modeled as the recursive application of a point-to-set map. This structure is used to compare several earlier sufficient conditions as well as three new sets of sufficient conditions. One of the new sets of conditions is shown to be the most general in that all other sets of conditions imply this new set. This new set of conditions is also extended to the case where the point-to-set map can change from iteration to iteration.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call