Abstract
For a finite/infinite family of closed convex sets with nonempty intersection in Hilbert space, we consider the (bounded) linear regularity property and the linear convergence property of the projection-based methods for solving the convex feasibility problem. Several sufficient conditions are provided to ensure the bounded linear regularity in terms of the interior-point conditions and some finite codimension assumptions. A unified projection method, called Algorithm B-EMOPP, for solving the convex feasibility problem is proposed, and by using the bounded linear regularity, the linear convergence results for this method are established under a new control strategy introduced here.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
