Strong Convergence of the Projection Method in Convex Feasibility Problem

2007 ◽  
Author(s):  
Stefan Maruster ◽  
Cristina Popirlan
Keyword(s):  
Strong Convergence ◽  
Projection Method ◽  
Convex Feasibility Problem ◽  
Feasibility Problem ◽  
Convex Feasibility

CONVERGENCE OF MANN’S ALTERNATING PROJECTIONS IN CAT() SPACES

2018 ◽  
Vol 98 (1) ◽  
pp. 134-143 ◽  
Author(s):  
BYOUNG JIN CHOI
Keyword(s):  
Strong Convergence ◽  
Projection Method ◽  
Convex Feasibility Problem ◽  
Feasibility Problem ◽  
Alternating Projections ◽  
Normed Spaces ◽  
Closed Sets ◽  
Convex Feasibility ◽  
Alternating Projection ◽  
Iterative Projection Method

We study the convex feasibility problem in$\text{CAT}(\unicode[STIX]{x1D705})$spaces using Mann’s iterative projection method. To do this, we extend Mann’s projection method in normed spaces to$\text{CAT}(\unicode[STIX]{x1D705})$spaces with$\unicode[STIX]{x1D705}\geq 0$, and then we prove the$\unicode[STIX]{x1D6E5}$-convergence of the method. Furthermore, under certain regularity or compactness conditions on the convex closed sets, we prove the strong convergence of Mann’s alternating projection sequence in$\text{CAT}(\unicode[STIX]{x1D705})$spaces with$\unicode[STIX]{x1D705}\geq 0$.

scholarly journals Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Hasanen A. Hammad ◽  
Habib ur Rehman ◽  
Yaé Ulrich Gaba
Keyword(s):  
Strong Convergence ◽  
Hilbert Spaces ◽  
Split Feasibility Problem ◽  
Convex Feasibility Problem ◽  
Feasibility Problem ◽  
Projection Algorithms ◽  
Convergence Theorems ◽  
Numerical Examples ◽  
Convex Feasibility ◽  
Split Feasibility

The goal of this manuscript is to establish strong convergence theorems for inertial shrinking projection and CQ algorithms to solve a split convex feasibility problem in real Hilbert spaces. Finally, numerical examples were obtained to discuss the performance and effectiveness of our algorithms and compare the proposed algorithms with the previous shrinking projection, hybrid projection, and inertial forward-backward methods.

Order Reduction of Controller Based on LMIs Improving Error Bounds

1997 ◽  
Author(s):  
Roberd Saragih ◽  
Yoshida Kazuo
Keyword(s):  
Projection Method ◽  
Order Reduction ◽  
Feasibility Problem ◽  
Closed Loop System ◽  
Reduced Order ◽  
Bounded Real Lemma ◽  
Convex Feasibility ◽  
Alternating Projection ◽  
Alternating Projection Method ◽  
Order Reduction Method

Abstract In this paper, we propose an order reduction method of controller based on combination of the alternating projection method and the balanced truncation. In this method both the errors of controller and the closed-loop system caused by the reduced-order controller can be improved simultaneously. By using a generalized Bounded Real Lemma, a feasible reduced-order controller can be derived. The sufficient condition for the existence of a reduced-order controller leads to a non-convex feasibility problem. To solve the problem, we can use an improved computational scheme based on the alternating projection method. But it is needed so much time to solve the problem if compared by the other methods. To validate the proposed method, some numerical calculations and simulations are carried out.

Steered sequential projections for the inconsistent convex feasibility problem

2004 ◽  
Vol 59 (3) ◽  
pp. 385-405 ◽  
Author(s):  
Yair Censor ◽  
Alvaro R. De Pierro ◽  
Maroun Zaknoon
Keyword(s):  
Convex Feasibility Problem ◽  
Feasibility Problem ◽  
Convex Feasibility
Sign in / Sign up

Export Citation Format

Share Document