scholarly journals k -center Clustering under Perturbation Resilience

2020 ◽  
Vol 16 (2) ◽  
pp. 1-39
Author(s):  
Maria-Florina Balcan ◽  
Nika Haghtalab ◽  
Colin White

Author(s):  
Konstantin Makarychev ◽  
Yury Makarychev


2017 ◽  
Vol 33 (4) ◽  
pp. 044007 ◽  
Author(s):  
Hongjin He ◽  
Hong-Kun Xu


2017 ◽  
Vol 33 (4) ◽  
pp. 044005 ◽  
Author(s):  
Simeon Reich ◽  
Alexander J Zaslavski


Axioms ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 197
Author(s):  
Yingying Li ◽  
Yaxuan Zhang

In this paper, we present some modified relaxed CQ algorithms with different kinds of step size and perturbation to solve the Multiple-sets Split Feasibility Problem (MSSFP). Under mild assumptions, we establish weak convergence and prove the bounded perturbation resilience of the proposed algorithms in Hilbert spaces. Treating appropriate inertial terms as bounded perturbations, we construct the inertial acceleration versions of the corresponding algorithms. Finally, for the LASSO problem and three experimental examples, numerical computations are given to demonstrate the efficiency of the proposed algorithms and the validity of the inertial perturbation.





Mathematics ◽  
2019 ◽  
Vol 7 (6) ◽  
pp. 535
Author(s):  
Yanni Guo ◽  
Xiaozhi Zhao

In this paper, a multi-parameter proximal scaled gradient algorithm with outer perturbations is presented in real Hilbert space. The strong convergence of the generated sequence is proved. The bounded perturbation resilience and the superiorized version of the original algorithm are also discussed. The validity and the comparison with the use or not of superiorization of the proposed algorithms were illustrated by solving the l 1 − l 2 problem.



Sign in / Sign up

Export Citation Format

Share Document