An analytic center quadratic cut method for the convex quadratic feasibility problem

2002 ◽  
Vol 93 (2) ◽  
pp. 305-325 ◽  
Author(s):  
Faranak Sharifi Mokhtarian ◽  
Jean-Louis Goffin
Keyword(s):  
Feasibility Problem ◽  
Analytic Center ◽  
Cut Method

Expression of Ki-67 has Correlation with the Degree and Size of Endometriosis Cysts

2015 ◽  
Vol 1 (1) ◽  
Author(s):  
Ruswana Anwar ◽  
Muhammad Alif ◽  
Adhi Pribadi
Keyword(s):  
Laparoscopic Surgery ◽  
Cell Nucleus ◽  
Significant Relationship ◽  
Strong Relationship ◽  
Cyst Size ◽  
Ki 67 ◽  
Cut Method ◽  
Close Relationship ◽  
Dividing Cells ◽  
Aggressive Tumor

Endometriosis is one of the most common gynecological problem. Cells resulted in chronic inflammation and progressive, proliferative, invasive and even infiltrating an area that resembles the character of the malignancy. Ki-67 is an antigen on the cell nucleus that is found only in actively dividing cells. Expression of Ki-67 are associated with an aggressive tumor and metastasis. This study aims to determine the level of Ki-67 expression correlation with stage and size of the endometriosis cyst. Methods research is observational analytic cross cut method on 56 paraffin blocks of patients who have been diagnosed with endometriosis and had performed a laparotomy or laparoscopic surgery in Dr Hasan Sadikin Hospital. The results showed a significant relationship between the level of expression of Ki-67 with endometriosis cyst size (p <0.001) with a fairly strong relationship (0.55) according to statistics based on criteria Guilford. Moreover the results also showed a significant relationship between the level of expression of Ki-67 with endometriosis stage (p <0.001) with a fairly close relationship (0.564) according to statistics based on criteria Guilford. It can be concluded that the expression of Ki-67 associated with cyst size and stage of endometriosis. Keywords: Ki-67, endometriosis stage, endometriosis cyst

scholarly journals An alternating iteration algorithm for solving the split equality fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Meixia Li ◽  
Xueling Zhou ◽  
Haitao Che
Keyword(s):  
Fixed Point ◽  
Common Fixed Point ◽  
Split Feasibility Problem ◽  
Fixed Point Problem ◽  
Feasibility Problem ◽  
Iteration Algorithm ◽  
Point Problem ◽  
Contractive Mappings ◽  
Common Fixed Point Problem ◽  
Significant Generalization

Abstract In this paper, we are concerned with the split equality common fixed point problem. It is a significant generalization of the split feasibility problem, which can be used in various disciplines, such as medicine, military and biology, etc. We propose an alternating iteration algorithm for solving the split equality common fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings and prove that the sequence generated by the algorithm converges weakly to the solution of this problem. Finally, some numerical results are shown to confirm the feasibility and efficiency of the proposed algorithm.

Ball-relaxed projection algorithms for multiple-sets split feasibility problem

Optimization ◽  
2021 ◽  
pp. 1-31
Author(s):  
Guash Haile Taddele ◽  
Poom Kumam ◽  
Anteneh Getachew Gebrie ◽  
Jamilu Abubakar
Keyword(s):  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Projection Algorithms ◽  
Split Feasibility

scholarly journals An intermixed iteration for constrained convex minimization problem and split feasibility problem

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Kanyanee Saechou ◽  
Atid Kangtunyakarn
Keyword(s):  
Strong Convergence ◽  
Minimization Problem ◽  
Convergence Theorem ◽  
Split Feasibility Problem ◽  
Convex Minimization ◽  
Feasibility Problem ◽  
Strong Convergence Theorem ◽  
Convex Minimization Problem ◽  
Constrained Convex Minimization Problem ◽  
Split Feasibility

Abstract In this paper, we first introduce the two-step intermixed iteration for finding the common solution of a constrained convex minimization problem, and also we prove a strong convergence theorem for the intermixed algorithm. By using our main theorem, we prove a strong convergence theorem for the split feasibility problem. Finally, we apply our main theorem for the numerical example.

Sign in / Sign up

Export Citation Format

Share Document